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.

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

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… Expand

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.

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.Expand