A1 Vertaisarvioitu alkuperäisartikkeli tieteellisessä lehdessä
L MORPHISMS - BOUNDED DELAY AND REGULARITY OF AMBIGUITY
Tekijät: HONKALA J, SALOMAA A
Kustantaja: SPRINGER
Julkaisuvuosi: 1991
Journal: Lecture Notes in Computer Science
Tietokannassa oleva lehden nimi: LECTURE NOTES IN COMPUTER SCIENCE
Lehden akronyymi: LECT NOTES COMPUT SC
Vuosikerta: 510
Aloitussivu: 566
Lopetussivu: 574
Sivujen määrä: 9
ISSN: 0302-9743
Tiivistelmä
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.
Turun yliopiston Tutkimustietojärjestelmän portaali