Abstract
In this paper we consider the following problem: given all bi-infinite sequences of symbols satisfying certain constraints, search for a set X of words such that i): any concatenation of elements of X satisfies these constraints and ii): any sequence verifying the constraints can be “parsed” in elements of X.
Keywords
Proper Subset Finite Automaton Local Constraint Prefix Code Rich Composition
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Preview
Unable to display preview. Download preview PDF.
References
- [1]R. Adler, D. Coppersmith, M. Hassner, “Algorithms for sliding block codes”, IEEE Trans.Inform.Theory, vol.IT-29, pp. 5–22, 1983.MathSciNetCrossRefMATHGoogle Scholar
- [2]M. P. Beal, “Codage, automates locaux et entropie”, These Université Paris V I, 1987.Google Scholar
- [3]J. Berstel, D. Perrin, “Theory of codes”, Academic Press, 1985.MATHGoogle Scholar
- [4]F. Blanchard, G. Hansel, “Systemes codes”, Theor. Computer Science, vol. 44, pp. 17–49, 1986.MathSciNetCrossRefMATHGoogle Scholar
- [5]P.A. Franaszek, “A general method for channel coding”, IBM J. Res. Dev., vol. 24, pp. 638–641, 1980.MathSciNetCrossRefMATHGoogle Scholar
- [6]B. Marcus, “Sofic systems and encoding data”, IEEE Trans.Inform.Theory vol.lT-31, pp. 366–377, 1985.MathSciNetCrossRefMATHGoogle Scholar
- [7]A. Restivo, “Codes and local constraints”, Theor. Computer Science (to appear ), 1988.Google Scholar
- [8]A. Restivo, “Finitely generated sofic systems” Theor.Computer Science (to appear), 1988.Google Scholar
Copyright information
© Springer-Verlag New York Inc. 1990