A note on DOL length sets

DOI10.1016/0012-365X(78)90056-0zbMATH0374.68049MaRDI QIDQ1245003FDOQ1245003

Authors Andrzej Ehrenfeucht, Juhani Karhumäki, Grzegorz Rozenberg

Publication date 1978

Published in Discrete Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• scientific article; zbMATH DE number 3117635 (Why is no real title available?)
• scientific article; zbMATH DE number 3707795 (Why is no real title available?)
• scientific article; zbMATH DE number 192839 (Why is no real title available?)
• scientific article; zbMATH DE number 3471632 (Why is no real title available?)
• scientific article; zbMATH DE number 3569855 (Why is no real title available?)
• scientific article; zbMATH DE number 3186965 (Why is no real title available?)
• Description of developmental languages using recurrence systems
• Nonterminals, homomorphisms and codings in different variations of OL- systems. I: Deterministic systems
• On the decidability of some equivalence problems for DOL-systems

Cited in

(2)

• On the ratio of growth functions in EDTOL languages
• A characterization of morphic words with polynomial growth

This page was built for publication: A note on DOL length sets

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