Skip to main content
SpringerLink
Log in

Unique decipherability for partially commutative alphabet (extended abstract)

  • Communications
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1986 (MFCS 1986)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 233))

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Apostolico, R. Giancarlo, Pattern matching machine implementation of a fast test for unique decipherability, Inf. Proc. Letters 18 (1984) 155–158.

    Google Scholar 

  2. R.M. Capocelli, A note on uniquely decipherable codes, IEEE Trans. on Inf. Theory IT-25 (1979) 90–94.

    Google Scholar 

  3. S. Even, Tests for unique decipherability, IEEE Trans. Information Theory IT-9 (1963) 103–112.

    Google Scholar 

  4. C.M. Hoffman, A note on unique decipherability, Proc. 11th MFCS, LNCS 176, Springer-Verlag, 1984, 50–63.

    Google Scholar 

  5. J.Hopcroft, J. Ullman, Formal Languages and their Relation to Automata, Addison-Wesley, 1969.

    Google Scholar 

  6. A.Mazurkiewicz, Concurrent programs schemes and their interpretations, DAIMI-PB 78, Aarhus University (1977).

    Google Scholar 

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

    Google Scholar 

  8. M. Rodeh, A fast test for unique decipherability based on suffix trees, IEEE Trans. Information Theory IT-28 (1982) 648–651.

    Google Scholar 

  9. W.Rytter, Some properties of trace languages, Fundamenta Informatica (1984).

    Google Scholar 

  10. W.Rytter, The space complexity of the unique decipherability problem, to appear in Inform. Proc. Letters.

    Google Scholar 

Download references

Author information

Author notes

  1. Wojciech Rytter

    Present address: Dept. of Comput. Sci., University of Warwick, USA

Authors and Affiliations

  1. Institute of Informatics, Warsaw University, PKIN VIII p, 00-901, Warsaw, Poland

    Marek Chrobak & Wojciech Rytter

Authors
  1. Marek Chrobak
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wojciech Rytter
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jozef Gruska Branislav Rovan Juraj Wiedermann

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation