Zobrazeno 1 - 10
of 157
pro vyhledávání: '"Prefix grammar"'
Publikováno v:
Applied Soft Computing. 57:684-695
In some pattern recognition problems, the syntactic or structural information that describes each pattern is important. A syntactic pattern can be described using string grammar. There is only a handful of research works involving with the string gra
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fadc578d322fe2059797ca5b0f216bf4
https://doi.org/10.1016/j.asoc.2017.04.037
https://doi.org/10.1016/j.asoc.2017.04.037
Publikováno v:
Theoretical Computer Science. 659:1-13
A $1$-prefix normal word is a binary word with the property that no factor has more $1$s than the prefix of the same length; a $0$-prefix normal word is defined analogously. These words arise in the context of indexed binary jumbled pattern matching,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b63a01fdf2a63583d6e0de86ed551afc
https://doi.org/10.1016/j.tcs.2016.10.015
https://doi.org/10.1016/j.tcs.2016.10.015
Autor:
Janusz A. Brzozowski, Corwin Sinnamon
Publikováno v:
Acta Cybernetica. 23:9-41
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7f3854624195ac8170c29d0d4f0e3388
https://doi.org/10.14232/actacyb.23.1.2017.3
https://doi.org/10.14232/actacyb.23.1.2017.3
Autor:
Antonina Nepeivoda
Publikováno v:
Journal of Logical and Algebraic Methods in Programming. 85:782-804
This paper presents a technique to model ping-pong protocols by prefix grammars in such a way that the security of the protocol models becomes decidable by a general-purpose program transformation tool with unfolding. The presented approach not only
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::64126146fa99f44a56fbd923ed85c378
https://doi.org/10.1016/j.jlamp.2016.06.001
https://doi.org/10.1016/j.jlamp.2016.06.001
Autor:
Kitti Gelle, Szabolcs Iván
A prefix grammar is a context-free grammar whose nonterminals generate prefix-free languages. A prefix grammar $G$ is an ordinal grammar if the language $L(G)$ is well-ordered with respect to the lexicographic ordering. It is known that from a finite
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::43895f3d7c187da82b5341a0e6cadb43
http://arxiv.org/abs/1811.03595
http://arxiv.org/abs/1811.03595
Autor:
Antonina Nepeivoda
Publikováno v:
VPT@CAV
The paper describes how to verify cryptographic protocols by a general-purpose programtransformation technique with unfolding. The questions of representation and analysisof the protocols as prefix rewriting grammars are discussed. In these aspects H
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7bfb8ebafeaf57470b4bf6458d0d190d
https://doi.org/10.29007/lw7c
https://doi.org/10.29007/lw7c
Autor:
Tim Smith
Publikováno v:
Theoretical Computer Science. 595:1-10
A deterministic L system generates an infinite word α if each word in its derivation sequence is a prefix of the next, yielding α as a limit. We generalize this notion to arbitrary L systems via the concept of prefix languages. A prefix language is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fe84cfb4029a4d8fb0d5430b9f732e80
https://doi.org/10.1016/j.tcs.2015.05.049
https://doi.org/10.1016/j.tcs.2015.05.049
Publikováno v:
Membrane Computing ISBN: 9783319540719
Int. Conf. on Membrane Computing
Int. Conf. on Membrane Computing
Rewriting P systems, as language generating devices, are one of the earliest classes of P systems with structured strings as objects and the rewriting rules as evolution rules. Flat splicing is an operation on strings, inspired by a splicing operatio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::77c29d02730b84e704f983063c19e3e3
https://doi.org/10.1007/978-3-319-54072-6_21
https://doi.org/10.1007/978-3-319-54072-6_21
In this paper we focus on the decomposition of rational and maximal prefix codes. We present an effective procedure that allows us to decide whether such a code is decomposable. In this case, the procedure also produces the factors of some of its dec
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::194941261edb11160858994306c71c10
http://hdl.handle.net/10447/230629
http://hdl.handle.net/10447/230629
Publikováno v:
Cellular Automata and Discrete Complex Systems ISBN: 9783319586304
AUTOMATA
Lecture Notes in Computer Science
23th International Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA)
23th International Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA), Jun 2017, Milan, Italy. pp.19-31, ⟨10.1007/978-3-319-58631-1_2⟩
AUTOMATA
Lecture Notes in Computer Science
23th International Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA)
23th International Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA), Jun 2017, Milan, Italy. pp.19-31, ⟨10.1007/978-3-319-58631-1_2⟩
Part 2: Regular Papers; International audience; A two-dimensional code is defined as a set of rectangular pictures over an alphabet $\varSigma $ such that any picture over $\varSigma $ is tilable in at most one way with pictures in X. It is in genera
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4d903894bfaca916dba1ebb10afae6c1
http://hdl.handle.net/20.500.11769/94815
http://hdl.handle.net/20.500.11769/94815