On Infinite Words Determined by L Systems

DOI10.1007/978-3-642-40579-2_25zbMath1398.68285OpenAlexW1554118014MaRDI QIDQ2849993

No author found.

Publication date: 20 September 2013

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-40579-2_25

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items (2)

A new pumping lemma for indexed languages, with an application to infinite words ⋮ On infinite words determined by L systems

This page was built for publication: On Infinite Words Determined by L Systems