A1 Refereed original research article in a scientific journal
L MORPHISMS - BOUNDED DELAY AND REGULARITY OF AMBIGUITY
Authors: HONKALA J, SALOMAA A
Publisher: SPRINGER
Publication year: 1991
Journal: Lecture Notes in Computer Science
Journal name in source: LECTURE NOTES IN COMPUTER SCIENCE
Journal acronym: LECT NOTES COMPUT SC
Volume: 510
First page : 566
Last page: 574
Number of pages: 9
ISSN: 0302-9743
Abstract
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.
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.