Skip to main content
SpringerLink
Log in

Communication of Two Stacks and Rewriting

  • Conference paper
Automata, Languages and Programming (ICALP 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4052))

Included in the following conference series:

Abstract

Rewriting systems working on words with a center marker are considered. The derivation is done by erasing a prefix or a suffix and then adding a prefix or a suffix. This can be naturally viewed as two stacks communicating with each other according to a fixed protocol. The paper systematically considers different cases of these systems and determines their expressiveness. Several cases are identified where very limited communication surprisingly yields universal computation power.

Supported by the Academy of Finland under grants 206039 and 208414.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Baker, B.S., Book, R.V.: Reversal-bounded multipushdown machines. Journal of Computer and System Sciences 8, 315–332 (1974)

    Article  MATH  MathSciNet  Google Scholar 

  2. Benois, M.: Parties rationnelles du groupe libre. C. R. Acad. Sci. Paris Series A 269, 1188–1190 (1969)

    MATH  MathSciNet  Google Scholar 

  3. Büchi, J.R.: Regular canonical systems. Arch. Math. Logic Grundlagenforsch 6, 91–111 (1964)

    Article  MATH  Google Scholar 

  4. Conway, J.H.: Regular Algebra and Finite Machines. Chapman and Hall, Boca Raton (1971)

    MATH  Google Scholar 

  5. Hofbauer, D., Waldmann, J.: Deleting string rewriting systems preserve regularity. Theoretical Computer Science 327(3), 301–317 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  6. Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading (1979)

    MATH  Google Scholar 

  7. Karhumäki, J., Kunc, M., Okhotin, A.: Computing by commuting. Theoretical Computer Science (to appear)

    Google Scholar 

  8. Kratko, M.I.: On a certain class of Post calculi. Soviet Math. Doklady 6, 1544–1545 (1965)

    MATH  Google Scholar 

  9. Kunc, M.: The Power of Commuting with Finite Sets of Words. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol. 3404, pp. 569–580. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  10. Post, E.L.: Formal reductions of the general combinatorial decision problem. American Journal of Mathematics 65(2), 197–215 (1943)

    Article  MATH  MathSciNet  Google Scholar 

  11. Sakarovitch, J.: Elements de théorie des automates, Vuibert (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Turku, Turku Centre for Computer Science, FIN 20014, Turku, Finland

    Juhani Karhumäki, Michal Kunc & Alexander Okhotin

Authors
  1. Juhani Karhumäki
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michal Kunc
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Alexander Okhotin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dipartimento di Informatica, Università Ca’ Foscari, Venice,  

    Michele Bugliesi

  2. Interdisciplinary Institute for BroadBand Technology (IBBT), Belgium

    Bart Preneel

  3. ECS, University of Southampton, UK

    Vladimiro Sassone

  4. FB Informatik, LS2, Univ. Dortmund, 44221, Dortmund, Germany

    Ingo Wegener

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Karhumäki, J., Kunc, M., Okhotin, A. (2006). Communication of Two Stacks and Rewriting. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds) Automata, Languages and Programming. ICALP 2006. Lecture Notes in Computer Science, vol 4052. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11787006_40

Download citation

  • DOI: https://doi.org/10.1007/11787006_40

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-35907-4

  • Online ISBN: 978-3-540-35908-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation