Bounded delay L codes

DOI10.1016/0304-3975(91)90163-VzbMath0735.68051OpenAlexW1986698149MaRDI QIDQ1178694

Derick Wood, Hermann Maurer, Arto Salomaa

Publication date: 26 June 1992

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

Full work available at URL: https://doi.org/10.1016/0304-3975(91)90163-v

zbMATH Keywords

L-codebounded delay codes

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Cryptography (94A60) Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items (2)

Caractérisation results about $L$ codes ⋮ On D0L systems with immigration

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• L codes and number systems
• Unique representation in number systems and L codes
• Bases and ambiguity of number systems
• Linear numeration systems of order two
• Ambiguity and decision problems concerning number systems
• It is decidable whether or not a permutation-free morphism is an l code

This page was built for publication: Bounded delay L codes