Abstract
We consider the unique decipherability problem for partially commutative alphabet. It is shown that the complexity of this problem depends heavily on the size of the alphabet and the structure of the commutativity relation graph. In particular, for alphabets with ≤3 letters the problem is decidable and for alphabets with ≥4 letters the problem is undecidable.
A part of this work was done while the second author was visiting University of Salerno, Dept. of Informatics.
Preview
Unable to display preview. Download preview PDF.
References
A. Apostolico, R. Giancarlo, Pattern matching machine implementation of a fast test for unique decipherability, Inf. Proc. Letters 18 (1984) 155–158.
R.M. Capocelli, A note on uniquely decipherable codes, IEEE Trans. on Inf. Theory IT-25 (1979) 90–94.
S. Even, Tests for unique decipherability, IEEE Trans. Information Theory IT-9 (1963) 103–112.
C.M. Hoffman, A note on unique decipherability, Proc. 11th MFCS, LNCS 176, Springer-Verlag, 1984, 50–63.
J.Hopcroft, J. Ullman, Formal Languages and their Relation to Automata, Addison-Wesley, 1969.
A.Mazurkiewicz, Concurrent programs schemes and their interpretations, DAIMI-PB 78, Aarhus University (1977).
D.Perrin, Words over a partially commutative alphabet, in: Combinatorial Algorithms on Words, A.Apostolico and Z.Galil eds., NATO ASI Series, Springer-Verlag, 1984.
M. Rodeh, A fast test for unique decipherability based on suffix trees, IEEE Trans. Information Theory IT-28 (1982) 648–651.
W.Rytter, Some properties of trace languages, Fundamenta Informatica (1984).
W.Rytter, The space complexity of the unique decipherability problem, to appear in Inform. Proc. Letters.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chrobak, M., Rytter, W. (1986). Unique decipherability for partially commutative alphabet (extended abstract). In: Gruska, J., Rovan, B., Wiedermann, J. (eds) Mathematical Foundations of Computer Science 1986. MFCS 1986. Lecture Notes in Computer Science, vol 233. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0016249
Download citation
DOI: https://doi.org/10.1007/BFb0016249
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16783-9
Online ISBN: 978-3-540-39909-4
eBook Packages: Springer Book Archive