On the union of 0L languages

DOI10.1016/0020-0190(93)90225-XzbMath0788.68085OpenAlexW2017318974MaRDI QIDQ685483

Arto Salomaa, Gheorghe Păun, Juergen Dassow

Publication date: 9 June 1994

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(93)90225-x

zbMATH Keywords

decidabilityunionL systemsAFL

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

Decidability of operation problems for T0L languages and subclasses ⋮ Undecidability of Operation Problems for T0L Languages and Subclasses

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Characterization of unary developmental languages
• Solution of a decision problem concerning unary Lindenmayer systems
• Description of developmental languages using recurrence systems

This page was built for publication: On the union of 0L languages