Skip to main content
SpringerLink
Log in

On the Complexity of Free Monoid Morphisms

  • Conference paper
  • First Online:
Algorithms and Computation (ISAAC 1998)

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

Included in the following conference series:

Abstract

We locate the complexities of evaluating, of inverting, and of testing membership in the image of, morphisms h: Σ* → Δ*. By and large, we show these problems complete for classes within NL. Then we develop new properties of finite codes and of finite sets of words, which yield image membership subproblems that are closely tied to the unambiguous space classes found between L and NL.

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. E. Allender, V. Arvind, and M. Mahajan, Arithmetic Complexity, Kleene Closure, and Formal Power Series, DIMACS TechRep. 97–61, September 1997.

    Google Scholar 

  2. E. Allender and K.-J. Lange, St USPA CE (log n) ⊂-DSPACE log2 n/ log log n), Proc. of the 7th ISAAC, Springer LNCS vol. 1178, pp. 193–202, 1996.

    Google Scholar 

  3. D. A. M. Barrington. Bounded-width polynomial-size branching programs recognize exactly those languages in NC1. J. Comput. System Sci., 38:150–164, 1987.

    Article  MathSciNet  Google Scholar 

  4. D. A. M. Barrington, N. Immerman, and H. Straubing. On uniformity within NC1. Journal of Computer and System Sciences, 41:274–306, 1990.

    Article  MATH  MathSciNet  Google Scholar 

  5. D. Barrington and D. Thérien, Finite Monoids and the Fine Structure of NC1, J. of the ACM, 35(4):941–952, 1988.

    Article  Google Scholar 

  6. S. Eilenberg, Automata, Languages and Machines, Academic Press, Vol. B, (1976).

    Google Scholar 

  7. P. Flajolet and J. Steyaert, Complexity of classes of languages and operators, Rap. de Recherche 92 de l’IRIA Laboria, novembre 1974.

    Google Scholar 

  8. B. Jenner, Knapsack problems for NL, Information Processing Letters 54 (1995), pp. 169–174.

    Article  MATH  MathSciNet  Google Scholar 

  9. N. Jones. Space-bounded reducibility among combinatorial problems. Journal of Computer and System Sciences, 11:68–85, 1975.

    Article  MATH  MathSciNet  Google Scholar 

  10. J. Håstad, Computational Limitations for Small-Depth Circuits, PhD Thesis, M.I.T., ACM Doctoral Dissertation Awards, MIT Press (1987).

    Google Scholar 

  11. T. Harju and J. Karhumäki, Morphisms, in Handbook of Formal Languages, ed. G. Rozenberg and A. Salomaa, Springer, 1997.

    Google Scholar 

  12. K.-J. Lange, An unambiguous class possessing a complete set, Proc. 14th Annual Symp. on Theoret. Aspects of Computer Science, Springer LNCS vol. 1200, pp. 339–350, 1997.

    Google Scholar 

  13. P. McKenzie, P. Péladeau and D. Thérien, NC1: The Automata-Theoretic View-point, Computational Complexity 1:330–359, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  14. K. Reinhardt and E. Allender, Making nondeterminism unambiguous, Proc. of the 38th IEEE FOCS, pp. 244–253, 1997.

    Google Scholar 

  15. W. Rytter, The space complexity of the unique decipherability problem, Information Processing Letters 23 (1986), pp. 1–3.

    Article  MATH  MathSciNet  Google Scholar 

  16. M. Schützenberger, On finite monoids having only trivial subgroups, Information and Control 8, 190–194, 1965.

    Article  MATH  MathSciNet  Google Scholar 

  17. H. Straubing, Finite automata, formal logic, and circuit complexity, Birkhäuser, Boston, 1994.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Wilhelm-Schickard-Institut für Informatik, Universität Tübingen, Deutschland

    Klaus-Jörn Lange & Pierre McKenzie

Authors
  1. Klaus-Jörn Lange
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pierre McKenzie
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Korea Advanced Institute of Science and Technology, 373-1, Kusong-dong, Yusong-gu, Taejon, 305-701, Korea

    Kyung-Yong Chwa

  2. Department of Computer Science, University of California, Santa Barbara, CA, 93106, USA

    Oscar H. Ibarra

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lange, KJ., McKenzie, P. (1998). On the Complexity of Free Monoid Morphisms. In: Chwa, KY., Ibarra, O.H. (eds) Algorithms and Computation. ISAAC 1998. Lecture Notes in Computer Science, vol 1533. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49381-6_27

Download citation

  • DOI: https://doi.org/10.1007/3-540-49381-6_27

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65385-1

  • Online ISBN: 978-3-540-49381-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation