@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}
}

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

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

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

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

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

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.

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