DOL schemes and the periodicity of string embeddings

DOI10.1016/0304-3975(88)90010-2MaRDI QIDQ1173408zbMATH OpenOpenAlexFDO

Authors S. Singh

Publication date 1983

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(88)90010-2

zbMATH Keywords

finite DOL languagesstationary sets of DOL schemes

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3459899 (Why is no real title available?)
• scientific article; zbMATH DE number 3569855 (Why is no real title available?)
• scientific article; zbMATH DE number 3639163 (Why is no real title available?)
• Context-free and stationary languagest†
• Description of developmental languages using recurrence systems
• Hypercodes
• Hypercodes in deterministic and slender 0L languages
• The length sets of D0L languages are uniformly bounded

Cited in

(2)

• Repeatable words for substitution
• Finite DOL languages and codes

This page was built for publication: DOL schemes and the periodicity of string embeddings

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