L Codes and Number Systems

@article{Maurer1983LCA,
  title={L Codes and Number Systems},
  author={Hermann A. Maurer and Arto Salomaa and Derick Wood},
  journal={Theor. Comput. Sci.},
  year={1983},
  volume={22},
  pages={331-346}
}
Characterization Results for Time-Varying Codes
TLDR
First, it is shown that adaptive Huffman encodings are special cases ofencodings by time-varying codes, and three kinds of characterization results are focused on: characterization results based on decompositions over families of sets of words, a Schutzenberger like criterion, and a Sardinas-Patterson like characterization theorem.
Cases of Encodings by Generalized Adaptive Codes
TLDR
It is proved that adaptive Huffmanencodings and Lempel-Ziv encodings are particular cases of encodations by GA codes, and it is shown that any (n; 1;m) convolutional code satisfying certain conditions can be modelled as an adaptive code of orderm.
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
Special Cases of Encodings by Generalized Adaptive Codes
TLDR
It is shown that any (n,1,m) convolutional code satisfying certain conditions can be modelled as an adaptive code of order m, and a cryptographic scheme based on the connection between adaptive codes and Convolutional codes is described, and an insightful analysis of this scheme is presented.
On number systems with negative digits
TLDR
It is shown that the set of nonnegative integers represented by a number system -lf = (n,rn1,. . . ,mo) is n-recognizable and the equivalence problem for number systems is decidable.
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.
LOGIC AND p-RECOGNIZABLE SETS OF INTEGERS
TLDR
Cobham’s theorem is focused on which characterizes the sets recognizable in dierent bases p and on its generalization to N m due to Semenov.
On Number Systems with Finite Degree of Ambiguity
Abstract We show that it is decidable whether or not a given n -recognizable set is representable by a number system having finite degree of ambiguity. As a corollary we obtain an algorithm for
Bases and Ambiguity of Number Systems
Ambiguity and Decision Problems Concerning Number Systems
...
...

References

SHOWING 1-4 OF 4 REFERENCES
The mathematical theory of L systems
TLDR
A survey of the different areas of the theory of developmental systems and languages in such a way that it discusses typical results obtained in each particular problem area.
Kryptographische Verfahren in der Datenverarbeitung