Problèmes decidables concernant les TOL-langages unaires

DOI10.1016/0012-365X(77)90147-9MaRDI QIDQ1242453zbMATH OpenFDO

Authors Michel Latteux

Publication date 1977

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365X(77)90147-9

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• Characterization of unary developmental languages
• Description of developmental languages using recurrence systems
• scientific article; zbMATH DE number 3413820 (Why is no real title available?)
• scientific article; zbMATH DE number 3200658 (Why is no real title available?)
• On the decidability of some equivalence problems for DOL-systems
• Solution of a decision problem concerning unary Lindenmayer systems
• TOL systems and languages

Cited in

(1)

• A remark on regularity of parallel languages

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1242453)