Problèmes decidables concernant les TOL-langages unaires

DOI10.1016/0012-365X(77)90147-9zbMath0367.68052MaRDI QIDQ1242453

Michel Latteux

Publication date: 1977

Published in: Discrete Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

A remark on regularity of parallel languages

Cites Work

• 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
• On the decidability of some equivalence problems for DOL-systems
• TOL systems and languages

This page was built for publication: Problèmes decidables concernant les TOL-langages unaires