Code properties and homomorphisms of DOL systems

DOI10.1016/0304-3975(85)90020-9zbMath0565.68069OpenAlexW2022372253MaRDI QIDQ1058858

J. Blot

Publication date: 1985

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

Full work available at URL: https://doi.org/10.1016/0304-3975(85)90020-9

zbMATH Keywords

prefix codesuffix codebiprefix codesDOL systempolynomially bounded DOL languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42) Prefix, length-variable, comma-free codes (94A45)

Related Items (2)

Periodic D0L languages ⋮ Bounded D0L languages

Cites Work

• Finite DOL languages and codes
• On the structure of derivations in deterministic ETOL systems
• The decidability of the dol prefix problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Code properties and homomorphisms of DOL systems