Skip to main content
SpringerLink
Log in

Deciding Code Related Properties by Means of Finite Transducers

  • Conference paper
Sequences II

Abstract

Algorithms that run in time bounded by polynomials of low degree are given for deciding five code related properties. These algorithms apply to rational languages presented by means of non-deterministic finite automata. The algorithms avoid the construction of equivalent unambiguous automata. Instead they involve the construction of non-deterministic finite transducers. In each case the property being decided holds if and only if the associated transducer is single-valued.

This author’s research was supported in part by a Postdoctoral Fellowship of the Japan Society for the Promotion of Science.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aho, A., J. Hopcroft and J. Ullman: The Design and Analysis of Computer Algorithms. Reading, Mass.: Addison-Wesley 1974

    MATH  Google Scholar 

  2. Anisimov, A. V. and L. P. Lisovik: Equivalence problems for finite-automaton mappings into free and commutative semigroups. Cybernetics, 14, 321–327(1978)

    Article  Google Scholar 

  3. Berstel, J. and D. Perrin: Theory of Codes. Orlando, Florida: Academic Press 1985

    MATH  Google Scholar 

  4. Berstel, J. and D. Perrin: Trends in the theory of codes. Bull. European Assoc. Theor. Comput. Sci., 29, 84–95(1986)

    Google Scholar 

  5. Blattner, M. and T. Head: Single-valued a-Transducers. J. Comput. Syst. Sci., 15, 310–327(1977)

    Article  MathSciNet  MATH  Google Scholar 

  6. Book, R.: The base of the intersection of two free monoids. Discrete Appl. Math., 12, 13–20(1985)

    Article  MathSciNet  MATH  Google Scholar 

  7. Capocelli, R. M., L. Gargano and U. Vaccaro: An efficient algorithm for testing immutability of variable-length codes. IEEE Trans. Inform. Theory, IT-35, 1310–1314(1989)

    Article  MathSciNet  Google Scholar 

  8. Capocelli, R. M., L. Gargano and U. Vaccaro: Immutable codes. In: Sequences: Combinatorics, Compression, Security and Transmission, R. Capocelli, Ed. New York: Springer-Verlag 1990

    Google Scholar 

  9. Capocelli, R. M., L. Gargano and U. Vaccaro: Decoders with initial state invariance for multivalued encodings. Theor. Comput. Sci., to appear, (1991)

    Google Scholar 

  10. Capocelli, R. M., L. Gargano and U. Vaccaro: A test for the unique decipherability of multivalued encodings. Preprint, (1990)

    Google Scholar 

  11. Capocelli, R. M. and U. Vaccaro: Structure of decoders for multivalued encodings. Discrete Appl. Math., 23, 55–71(1989)

    Article  MathSciNet  MATH  Google Scholar 

  12. Denning, D. E. R.: Cryptography and Security. Reading, Mass.: Addison-Wesley 1982

    MATH  Google Scholar 

  13. Even, S.: Generalized automata and their information losslessness. Proc. Third Annual Symp. on Switching Circuit Theory and Logical Design, 3, 144–147(1962)

    Google Scholar 

  14. Gurari and O. Ibarra: A note on finite-valued and finitely ambiguous transducers. Math. Systems Theory, 16, 61–66(1983)

    Article  MathSciNet  MATH  Google Scholar 

  15. Head, T.: Unique decipherability relative to a language. Tamkang J. Math., 11, 59–66(1980)

    MathSciNet  MATH  Google Scholar 

  16. Head, T.: Deciding the immutability of regular codes and languages under finite transductions. Inform. Process. Letters, 31, 239–241(1989)

    Article  MathSciNet  MATH  Google Scholar 

  17. Kahn, D.: The Codebreakers. New York: Macmillan 1967

    Google Scholar 

  18. Karhumäki, J., W. Rytter and S. Jarominek: Efficient constructions of test sets for regular and context-free languages. Manuscript, (1991)

    Google Scholar 

  19. Lallement, G.: Semigroups and Combinatorial Theory. New York: Wiley 1979

    Google Scholar 

  20. Leiss, E. L.: Data integrity on optical disks. IEEE Trans. Comput., C-33, 818–827(1984)

    Article  Google Scholar 

  21. Leiss, E. L.: On testing immutability of codes. IEEE Trans. Inform. Theory, IT-33, 934–938(1987)

    Article  Google Scholar 

  22. Litow, B. E.: Parallel complexity of the regular code problem. Inform. and Comput., 86, 107–114(1990)

    Article  MathSciNet  MATH  Google Scholar 

  23. MacLane, S.: Categories for the Working Mathematician. New York: Springer-Verlag 1972

    Google Scholar 

  24. Paul, W.: Komplexitätstheorie. Stuttgart: Teubner 1978

    MATH  Google Scholar 

  25. Salomaa, A.: Computation and Automata. Cambridge: Cambridge Univ. Press 1985

    MATH  Google Scholar 

  26. Sato, K.: A decision procedure for the unique decipherability of multivalued encodings. IEEE Trans. Inform. Theory, IT-25, 356–360(1979)

    Article  Google Scholar 

  27. Schützenberger, M. P.: Sur les relations rationnelles entre monoïdes libres. Theor. Comput. Sci., 3, 243–259(1976)

    Article  Google Scholar 

  28. Stahl, F. A.: A homophonic cipher for computational cryptography. Proc. National Comput. Confer., 42, 565–568(1973)

    Google Scholar 

  29. Weber, A.: On the valuedness of finite transducers. Acta Inform., 27, 749–780(1990)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematical Sciences, State University of New York at Binghamton, 13902-6000, Binghamton, New York, USA

    Tom Head

  2. Fachbereich Informatik, J.W. Goethe-Universität, Postfach 111 932, D-6000, Frankfurt am Main 11, West Germany

    Andreas Weber

Authors
  1. Tom Head
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andreas Weber
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics, University of Rome “La Sapienza”, Rome, Italy

    Renato Capocelli

  2. Dipartimento di Informatica ed Applicazioni, Universitá di Salerno, 84081, Baronissi (SA), Italy

    Alfredo De Santis  & Ugo Vaccaro  & 

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag New York, Inc.

About this paper

Cite this paper

Head, T., Weber, A. (1993). Deciding Code Related Properties by Means of Finite Transducers. In: Capocelli, R., De Santis, A., Vaccaro, U. (eds) Sequences II. Springer, New York, NY. https://doi.org/10.1007/978-1-4613-9323-8_19

Download citation

  • DOI: https://doi.org/10.1007/978-1-4613-9323-8_19

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4613-9325-2

  • Online ISBN: 978-1-4613-9323-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation