A1 Refereed original research article in a scientific journal

L MORPHISMS - BOUNDED DELAY AND REGULARITY OF AMBIGUITY




AuthorsHONKALA J, SALOMAA A

PublisherSPRINGER

Publication year1991

JournalLecture Notes in Computer Science

Journal name in sourceLECTURE NOTES IN COMPUTER SCIENCE

Journal acronymLECT NOTES COMPUT SC

Volume510

First page 566

Last page574

Number of pages9

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



Last updated on 2024-26-11 at 22:13