L Morphisms: Bounded Delay and Regularity of Ambiguity

@inproceedings{Honkala1991LMB,
  title={L Morphisms: Bounded Delay and Regularity of Ambiguity},
  author={Juha Honkala and Arto Salomaa},
  booktitle={ICALP},
  year={1991}
}
We present characterization and decidability results concerning bounded delay of L codes. It is also shown that, for L morphisms (morphisms applied in the “L way”), the sets causing ambiguities are in most cases effectively regular. The results are closely linked with some fundamental issues (bounded delay, elementary morphisms, Defect Theorem) in the theory of codes and combinatorics of words in general. 
4 Citations
On D0L Systems with Immigration
Automata and Codes with Bounded Deciphering Delay
Two new and simple proofs of Schutzenberger's theorem on codes with bounded deciphering delay are given, using automata with bounded delay.
On Generalized DT0L Systems and Their Fixed Points
Characterization results about L codes
L'article etudie les interconnexions entre codes et L codes, presente des proprietes de caracterisation et de decidabilite pour les L codes a delai borne et discute des notions voisines

References

SHOWING 1-10 OF 21 REFERENCES
Regularity Properties of L Ambiguities of Morphisms
We study the L ambiguity of morphisms of the free monoid. We define four basic ambiguity sets and establish their effective regularity in many cases. Decidability results concerning L codes are
It is decidable whether or not a permutation-free morphism is an l code
We show that it is decidable whether or not a permutation-free morphism is an L code. We also show that the degree of L-ambiguity with respect to a set of words can be computed effectively.
Bounded Delay L Codes
L Codes and Number Systems
Simplifications of Homomorphisms
Bases and Ambiguity of Number Systems
Star-Free Sets of Integers
Linear Numeration Systems of Order Two
A Decision Method for The Recognizability of Sets Defined by Number Systems
  • J. Honkala
  • Computer Science
    RAIRO Theor. Informatics Appl.
  • 1986
TLDR
It is shown that it is decidable whether or not a k-recognizable set is recognizable and that the set defined by a number System is recognizable.
...
...