Skip to main content
SpringerLink
Log in

One-Way Multi-Head Finite Automata with Pebbles But No States

  • Conference paper
Developments in Language Theory (DLT 2013)

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

Included in the following conference series:

  • 743 Accesses

Abstract

Stateless variants of deterministic one-way multi-head finite automata with pebbles, that is, automata where the heads can drop, sense, and pick up pebbles, are studied. The relation between heads and pebbles is investigated, and a proper double hierarchy concerning these two resources is obtained. Moreover, it is shown that a conversion of an arbitrary automaton to a stateless automaton can always be achieved at the cost of additional heads and/or pebbles. On the other hand, there are languages where one head cannot be traded for any number of additional pebbles and vice versa. Finally, the emptiness problem and related problems are shown to be undecidable even for the ‘simplest’ model, namely, for stateless one-way finite automata with two heads and one pebble.

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. Brandenburg, F.J.: Three write heads are as good as k. Math. Systems Theory 14, 1–12 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  2. Chrobak, M.: Hierarchies of one-way multihead automata languages. Theoret. Comput. Sci. 48, 153–181 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  3. Eğecioğlu, Ö., Ibarra, O.H.: On stateless multicounter machines. In: Ambos-Spies, K., Löwe, B., Merkle, W. (eds.) CiE 2009. LNCS, vol. 5635, pp. 178–187. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  4. Frisco, P., Ibarra, O.H.: On stateless multihead finite automata and multihead pushdown automata. In: Diekert, V., Nowotka, D. (eds.) DLT 2009. LNCS, vol. 5583, pp. 240–251. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  5. Gorlick, M.M.: Computation by one-way multihead marker automata. Master’s thesis, Department of Computer Science, University of British Columbia (1978)

    Google Scholar 

  6. Holzer, M., Kutrib, M., Malcher, A.: Complexity of multi-head finite automata: Origins and directions. Theoret. Comput. Sci. 412, 83–96 (2011)

    Article  MathSciNet  MATH  Google Scholar 

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

    Google Scholar 

  8. Ibarra, O.H., Eğecioğlu, Ö.: Hierarchies and characterizations of stateless multicounter machines. In: Ngo, H.Q. (ed.) COCOON 2009. LNCS, vol. 5609, pp. 408–417. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  9. Ibarra, O.H., Karhumäki, J., Okhotin, A.: On stateless multihead automata: Hierarchies and the emptiness problem. Theoret. Comput. Sci. 411, 581–593 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  10. Kutrib, M.: Cellular automata – a computational point of view. In: Bel-Enguix, G., Jiménez-López, M.D., Martín-Vide, C. (eds.) New Developments in Formal Languages and Applications. SCI, vol. 113, pp. 183–227. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  11. Kutrib, M.: Cellular automata and language theory. In: Encyclopedia of Complexity and System Science, pp. 800–823. Springer (2009)

    Google Scholar 

  12. Kutrib, M., Malcher, A., Wendlandt, M.: States and heads do count for unary multi-head finite automata. In: Yen, H.-C., Ibarra, O.H. (eds.) DLT 2012. LNCS, vol. 7410, pp. 214–225. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  13. Kutrib, M., Messerschmidt, H., Otto, F.: On stateless deterministic restarting automata. Acta Inform. 47, 391–412 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  14. Kutrib, M., Messerschmidt, H., Otto, F.: On stateless two-pushdown automata and restarting automata. Int. J. Found. Comput. Sci. 21, 781–798 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  15. Kutyłowski, M.: One-way multihead finite automata and 2-bounded languages. Math. Systems Theory 23, 107–139 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  16. Li, M., Vitányi, P.M.B.: An Introduction to Kolmogorov Complexity and Its Applications. Springer (1993)

    Google Scholar 

  17. Malcher, A.: Descriptional complexity of cellular automata and decidability questions. J. Autom., Lang. Comb. 7, 549–560 (2002)

    MathSciNet  MATH  Google Scholar 

  18. Petersen, H.: Automata with sensing heads. In: Proceedings of the Third Israel Symposium on the Theory of Computing and Systems, pp. 150–157. IEEE Computer Society Press (1995)

    Google Scholar 

  19. Rabin, M.O., Scott, D.: Finite automata and their decision problems. IBM J. Res. Dev. 3, 114–125 (1959)

    Article  MathSciNet  Google Scholar 

  20. Ritchie, R.W., Springsteel, F.N.: Language recognition by marking automata. Inform. Control 20, 313–330 (1972)

    Article  MathSciNet  MATH  Google Scholar 

  21. Rosenberg, A.L.: On multi-head finite automata. IBM J. Res. Dev. 10, 388–394 (1966)

    Article  MATH  Google Scholar 

  22. Sudborough, I.H.: One-way multihead writing finite automata. Inform. Control 30, 1–20 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  23. Yang, L., Dang, Z., Ibarra, O.H.: On stateless automata and P systems. Int. J. Found. Comput. Sci. 19, 1259–1276 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  24. Yao, A.C., Rivest, R.L.: k + 1 heads are better than k. J. ACM 25, 337–340 (1978)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Universität Giessen, Arndtstr. 2, 35392, Giessen, Germany

    Martin Kutrib, Andreas Malcher & Matthias Wendlandt

Authors
  1. Martin Kutrib
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andreas Malcher
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Matthias Wendlandt
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. LIGM, University Paris-Est Marne-la-Vallée, 5 Bd Descartes, Champs-sur-Marne, 77454, Marne-la-Vallée Cedex 2, France

    Marie-Pierre Béal

  2. LIAFA, UMR 7089, University Paris Diderot, 75205, Paris cedex 13, France

    Olivier Carton

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kutrib, M., Malcher, A., Wendlandt, M. (2013). One-Way Multi-Head Finite Automata with Pebbles But No States. In: Béal, MP., Carton, O. (eds) Developments in Language Theory. DLT 2013. Lecture Notes in Computer Science, vol 7907. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38771-5_28

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-38771-5_28

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-38770-8

  • Online ISBN: 978-3-642-38771-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation