EDT0L grammars with only one variable have tractable generating functions

DOI10.1051/ita/2023004OpenAlexW4385243543MaRDI QIDQ6047790

Unnamed Author, Eric M. Freden

Publication date: 13 September 2023

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1051/ita/2023004

zbMATH Keywords

generating functionsEDT0LLindemayer systems

Mathematics Subject Classification ID

Combinatorics on words (68R15) Algebraic theory of languages and automata (68Q70)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On inherently ambiguous E0L languages
• On ambiguity in EOL systems
• Free subgroups in linear groups
• ON THE DESCRIPTIONAL COMPLEXITY OF LINDENMAYER SYSTEMS
• ON THE NUMBER OF ACTIVE SYMBOLS IN LINDENMAYER SYSTEMS
• A Gap Theorem for Power Series Solutions of Algebraic Differential Equations
• On some families of languages related to developmental systems
• TOL schemes and control sets
• The structure generating function of some families of languages
• Controlled iteration grammars and full hyper-AFL's
• ON THE UNDECIDABILITY OF FREENESS OF MATRIX SEMIGROUPS
• Applications of L systems to group theory
• From indexed grammars to generating functions
• Indexed Grammars—An Extension of Context-Free Grammars
• Nested Stack Automata
• On the entropy of context-free languages

This page was built for publication: EDT0L grammars with only one variable have tractable generating functions