Filters








16 Hits in 2.0 sec

On Finite-Index Indexed Grammars and Their Restrictions [article]

Flavio D'Alessandro, Oscar H. Ibarra, Ian McQuillan
2016 arXiv   pre-print
Here, we look at larger families of (restricted) indexed languages and study their properties, their relationships, and their decidability properties.  ...  The family, L(INDLIN), of languages generated by linear indexed grammars has been studied in the literature. It is known that the Parikh image of every language in L(INDLIN) is semi-linear.  ...  This is the case for finite-index ET0L, EDT0L, context-free programmed grammars, ordered grammars, and matrix grammars.  ... 
arXiv:1610.06366v3 fatcat:v4ea2oecnvhepjogjs2pm6ejsu

Bounded Automata Groups are co-ET0L [article]

Alex Bishop, Murray Elder
2018 arXiv   pre-print
Holt and R\"over proved that finitely generated bounded automata groups have indexed co-word problem. Here we sharpen this result to show they are in fact co-ET0L.  ...  [6] showed that the co-word problem was in fact ET0L. ET0L is a class of languages coming from L-systems which lies strictly between context-free and indexed [19, 20, 23, 24] .  ...  Since regular language is a subset of ET0L, then, by Lemma 2, the grammar G produces an ET0L language as required. Soundness and Completeness.  ... 
arXiv:1811.10157v1 fatcat:hqkdkg2pincvzo4ifntae5lese

Branching synchronization grammars with nested tables

Frank Drewes, Joost Engelfriet
2004 Journal of computer and system sciences (Print)  
A generalization of ET0L systems is introduced: grammars with branching synchronization and nested tables.  ...  : Note that the synchronization strings 000, 001, and 010 in the derivation of the branching ET0L system correspond to the positions of the subtrees t; u; and v; respectively, in the input tree t (where  ...  Context-free grammars are particularly well suited to formalize certain aspects of natural language grammar and, today perhaps more importantly, the syntax of programming languages.  ... 
doi:10.1016/j.jcss.2003.10.001 fatcat:kz4jfutqo5hyzaq3ha3szpiv2i

Hybrid modes in cooperating distributed grammar systems: combining the t-mode with the modes ⩽k and =k

H. Fernau, M. Holzer, R. Freund
2003 Theoretical Computer Science  
In particular, hybrid CD grammar systems with classical and internally hybrid modes have universal computational power, a result which is unknown for hybrid CD grammar systems whose components work only  ...  with ÿnite index.  ...  Since ÿnite index languages are semilinear [5, Lemma 3.1.5], the family of ET0L languages is a strict superfamily of its ÿnite index counterpart.  ... 
doi:10.1016/s0304-3975(02)00541-8 fatcat:juu2x7ubufe45oyw5otqqyohee

Solutions Sets to Systems of Equations in Hyperbolic Groups Are EDT0L in PSPACE

Laura Ciobanu, Murray Elder, Michael Wagner
2019 International Colloquium on Automata, Languages and Programming  
, partially commutative monoids and groups, and virtually free groups (that is, groups which have a free subgroup of finite index).  ...  We show that the full set of solutions to systems of equations and inequations in a hyperbolic group, with or without torsion, as shortlex geodesic words, is an EDT0L language whose specification can be  ...  The NFA that is printed gives an EDT0L grammar that generates a language of tuples which is a covering solution to the original system in the hyperbolic group.  ... 
doi:10.4230/lipics.icalp.2019.110 dblp:conf/icalp/CiobanuE19 fatcat:mpfuafgod5atphn7rywzw2ogn4

Cooperating Distributed Grammar Systems of Finite Index Working in Hybrid Modes

Henning Fernau, Rudolf Freund, Markus Holzer
2014 Electronic Proceedings in Theoretical Computer Science  
Secondly, we impose the finite index restriction on cooperating distributed grammar systems working in hybrid modes themselves, which leads us to new characterizations of programmed grammars of finite  ...  working in hybrid modes which characterize programmed grammars with the finite index restriction; looking at the number of components of such systems, we obtain surprisingly rich lattice structures for  ...  Acknowledgements Most of the research of the first and last author was undertaken while being affiliated to Wilhelm-Schickard Institut für Informatik, Universität Tübingen, Sand 13, D-72076 Tübingen, Germany  ... 
doi:10.4204/eptcs.151.17 fatcat:r3i5gxn5gjclrlbekcyoslmywm

Membrane Systems with External Control [chapter]

Robert Brijder, Matteo Cavaliere, Agustín Riscos-Núñez, Grzegorz Rozenberg, Dragoş Sburlan
2006 Lecture Notes in Computer Science  
When the control string is entirely consumed and no rule can be applied anymore, then the system halts -this corresponds to a successful computation.  ...  In this way, using a set of control strings (a control program), one generates a set of numbers.  ...  We denote by ET 0L the family of languages generated by ET0L systems, and by T 0L the family of languages generated by ET0L systems such that Σ = T .  ... 
doi:10.1007/11963516_14 fatcat:7ohfe3re2naefloqirpsdiyyt4

Reference List of Indexed Articles

2001 Information Processing Letters  
Rozenberg, More on ET0L systems versus random context grammars 5 (4) (1976) 102-106 233. B. Samadi, B-trees in a system with multiple users 5 (4) (1976) 107-112 234. H.N.  ...  Linna, The D0L-ness for context-free languages is decidable 5 (5) (1976) 149-151 242. J. Duske, R. Parchmann and H. Schumacher, A pattern representation of indexed languages 5 (5) (1976) 152-154 243.  ... 
doi:10.1016/s0020-0190(01)00177-6 fatcat:vksyqyokdzdztflaez5hlnchxy

Subject Index to Volumes 1–75

2001 Information Processing Letters  
free, 786 semantics, 786 syntax of a language, 24, 2198 natural language, 1059 syntax of atoms and terms, 847 natural languages, 3162 programming languages, 1331, 1988 set expressions, 3827  ...  synchronization primitives, 470 system overhead, 326 parameters, 142, 981, 1075, 1180 system performance, 2628 measure, 553 optimization, 553 system programming, 21, 151, 237, 1736 language,  ...  889, 1220, 1350, 1455, 1573, 1590, 1603, 1837, 1870, 1910, 2759, 2959, 3523, 3572, 4094 algorithm, 70, 701, 2745, 2759, 2959 Pascal programs into Prolog, 1297 Prolog, translation, 192, 336, 386, 708,  ... 
doi:10.1016/s0020-0190(01)00175-2 fatcat:5y67tfm6yfbblakrus5nnhs73e

The size of Higman–Haines sets

Hermann Gruber, Markus Holzer, Martin Kutrib
2007 Theoretical Computer Science  
for all supersets of the language family under consideration, and in particular for the family of recursively enumerable languages.  ...  We show that for the family of Church-Rosser languages the Higman-Haines sets, which are the sets of all scattered subwords of a given language and the sets of all words that contain some word of a given  ...  programmed grammars with unconditional transfer working under leftmost derivations of a certain type [3] was given.  ... 
doi:10.1016/j.tcs.2007.07.036 fatcat:pj5zmp5dfvhuvjridivq7l4zia

Sequential grammars and automata with valences

Henning Fernau, Ralf Stiebe
2002 Theoretical Computer Science  
We discuss the model of valence grammars, a simple extension of context-free grammars. We show closure properties of context-free valence languages over arbitrary monoids.  ...  Chomsky and Greibach normal form theorems and an iteration lemma for context-free valence grammars over the groups Z k are proved. The generative power of di erent control monoids is investigated.  ...  Staiger and D. Thà erien for stimulating discussions.  ... 
doi:10.1016/s0304-3975(01)00282-1 fatcat:az4zrslmvjc7fkwcihn7g5sxem

Tree Automata [article]

Ferenc Gécseg, Magnus Steinby
2015 arXiv   pre-print
G\'ecseg and M. Steinby originally published in 1984 by Akad\'emiai Kiad\'o, Budapest. Some mistakes have been corrected and a few obscure passages have been clarified.  ...  Moreover, some more recent contributions and current lines of research are reviewed in an appendix that also contains several new references.  ...  The devices used for producing the tree languages include regular tree grammars, ET0L tree grammars, branching tree grammars, and tree transducers.  ... 
arXiv:1509.06233v1 fatcat:ejhy6a7h2fcatcdfxv3hylresu

From Tree-Based Generators to Delegation Networks [chapter]

Frank Drewes
Algebraic Informatics  
The first part of this paper is a brief survey on tree-based generators, including some typical examples taken from the fields of string, tree, graph, and picture generation.  ...  I thank Joost Engelfriet for pointing out problems with the basic definitions (and, thus, results) of [Dre07] and suggesting possible remedies to me.  ...  ET0L systems.  ... 
doi:10.1007/978-3-540-75414-5_3 dblp:conf/cai/Drewes07 fatcat:6voumripazc4rd4ipxydq2thvu

The generative power of delegation networks

Frank Drewes, Joost Engelfriet
2015 Information and Computation  
We investigate the language-theoretic properties of these systems and establish several characterizations of the generated languages.  ...  It can be viewed as consisting of an (extended) IO context-free tree grammar and an interpretation.  ...  This is similar to the notion of C-extended context-free string grammars and ET0L systems, which have been studied in the context of AFL theory; see, e.g., [Lee74, Asv78] .  ... 
doi:10.1016/j.ic.2015.04.005 fatcat:ivawislg6ngohhdx3ykrys53qm

Factorizable Language: From Dynamics to Biology [chapter]

Bailin Hao, Huimin Xie
Reviews of Nonlinear Dynamics and Complexity  
In this review we concentrate on a special class of languages, namely, factorizable languages to be defined later, which occur in many problems of dynamics and biology.  ...  In dynamics we have in mind symbolic dynamics of unimodal maps and complexity of cellular automata. In biology we draw examples from DNA and protein sequence analysis.  ...  The L-system has been later extended to include non-terminal symbols to make E0L, ET0L and EIL languages.  ... 
doi:10.1002/9783527626359.ch5 fatcat:6xbp6ntldndkfbgokpdh4weoga
« Previous Showing results 1 — 15 out of 16 results