Bounded Delay L Codes

@article{Maurer1991BoundedDL,
  title={Bounded Delay L Codes},
  author={Hermann A. Maurer and Arto Salomaa and Derick Wood},
  journal={Theor. Comput. Sci.},
  year={1991},
  volume={84},
  pages={265-279}
}

Tables from this paper

L Morphisms: Bounded Delay and Regularity of Ambiguity
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
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
On D0L Systems with Immigration
Generalized L systems
This paper proposes the concept of generalized L systems, GL systems for short, which can describe asynchronized concurrent phenomena. We have proved that the GL systems are proper extensions of the
L Systems
TLDR
The fundamental L families constitute a similar testing ground as the Chomsky hierarchy when new devices (grammars, automata, etc.) and new phenomena are investigated in language theory.
Generalized L systems
TLDR
It is proved that the GL systems are proper extensions of the traditional L systems and a classification of GL systems is defined and a sufficient and necessary condition for the equivalence of two subclasses ofGL systems is proved.
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

References

SHOWING 1-10 OF 11 REFERENCES
L Codes and Number Systems
Unique representation in number systems and L codes
  • J. Honkala
  • Computer Science
    Discret. Appl. Math.
  • 1982
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.
Bases and Ambiguity of Number Systems
Public-Key Cryptography
  • A. Salomaa
  • Computer Science, Mathematics
    EATCS Monographs on Theoretical Computer Science
  • 1990
TLDR
This book gives a broad overview of public-key cryptography - its essence and advantages, various public- key cryptosystems, and protocols - as well as a comprehensive introduction to classical cryptography and cryptoanalysis.
Theory of codes
On codes concerning bi-infinite
  • 1983
...
...