scientific article; zbMATH DE number 176764

MaRDI QIDQ4036594zbMATH OpenFDO

Authors Juha Honkala, Arto Salomaa

Publication date 18 May 1993

zbMATH Keywords

\(L\) morphismsbounded delay of \(L\) codescharacterizationdecidability

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Combinatorics on words (68R15)

Recommendations

• scientific article; zbMATH DE number 176924
• scientific article; zbMATH DE number 3876632
• Noneffective regularity of equality languages and bounded delay morphisms
• Bounded delay L codes
• Maximal codes with bounded deciphering delay

Cited in

(9)

• Maximal codes with bounded deciphering delay
• Bounded delay L codes
• On D0L systems with immigration
• On generalized DT0L systems and their fixed points
• Caractérisation results about L codes
• scientific article; zbMATH DE number 176924 (Why is no real title available?)
• It is decidable whether or not a permutation-free morphism is an l code
• Noneffective regularity of equality languages and bounded delay morphisms
• L codes and number systems

This page was built for publication:

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