Caractérisation results about $L$ codes

DOI10.1051/ita/1992260302871zbMath0751.68033OpenAlexW107629870MaRDI QIDQ4012673

Juha Honkala, Arto Salomaa

Publication date: 27 September 1992

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/92419

zbMATH Keywords

\(L\) codes of bounded delay

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

On D0L systems with immigration

Cites Work

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

This page was built for publication: Caractérisation results about $L$ codes