A relationship between ETOL and EDTOL languages

DOI10.1016/0304-3975(76)90076-1zbMath0339.68055MaRDI QIDQ1231392

K. Appert

Publication date: 1976

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(76)90076-1

Mathematics Subject Classification ID

68Q45: Formal languages and automata

Related Items

Applications of L systems to group theory, Two applications of monoid actions to cross-sections, MULTIPLICATION TABLES AND WORD-HYPERBOLICITY IN FREE PRODUCTS OF SEMIGROUPS, MONOIDS AND GROUPS, Using \textsc{edt0l} systems to solve some equations in the solvable Baumslag-Solitar groups, Sur les générateurs algébriques et linéaires, A new pumping lemma for indexed languages, with an application to infinite words, Hierarchies of hyper-AFLs, Extended macro grammars and stack controlled machines, Languages with homomorphic replacements, The membership question for ETOL-languages is polynomially complete, Copying theorems, Iterating iterated substitution, On the structure of derivations in deterministic ETOL systems, Grouped partial ET0L systems and parallel multiple context-free grammars, The complexity of verbal languages over groups, The complexity of solution sets to equations in hyperbolic groups, A language hierarchy of binary relations, An Approach to Computing Downward Closures, Unnamed Item

Cites Work

• Nonterminals versus homomorphisms in defining languages for some classes of rewriting systems
• On the structure of derivations in deterministic ETOL systems
• L systems
• Extension of tabled 0L-systems and languages
• The number of occurrences of letters versus their distribution in some EOL languages
• Description of developmental languages using recurrence systems
• Decomposition Theorems for Various Kinds of Languages Parallel in Nature
• Indexed Grammars—An Extension of Context-Free Grammars
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item