Skip to main content
SpringerLink
Log in
Book cover

Algebraic Foundations in Computer Science pp 183–213Cite as

A Survey on Picture-Walking Automata

  • Chapter

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

Abstract

Picture walking automata were introduced by M. Blum and C. Hewitt in 1967 as a generalization of one-dimensional two-way finite automata to recognize pictures, or two-dimensional words. Several variants have been investigated since then, including deterministic, non-deterministic and alternating transition rules; four-, three- and two-way movements; single- and multi-headed variants; automata that must stay inside the input picture, or that may move outside. We survey results that compare the recognition power of different variants, consider their basic closure properties and study decidability questions.

Research supported by the Academy of Finland Grant 131558.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Blum, M., Hewitt, C.: Automata on a 2-dimensional tape. In: FOCS, pp. 155–160. IEEE, Los Alamitos (1967)

    Google Scholar 

  2. Giammarresi, D., Restivo, A.: Two-dimensional languages, pp. 215–267. Springer-Verlag New York, Inc., New York (1997), http://portal.acm.org/citation.cfm?id=267871.267875

    Google Scholar 

  3. Ibarra, O.H., Jiang, T., Wang, H.: Some results concerning 2-d on-line tessellation acceptors and 2-d alternating finite automata. In: Tarlecki, A. (ed.) MFCS 1991. LNCS, vol. 520, pp. 221–230. Springer, Heidelberg (1991)

    Chapter  Google Scholar 

  4. Inoue, K., Takanami, I.: Three-way tape-bounded two-dimensional turing machines. Inf. Sci. 17(3), 195–220 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  5. Inoue, K., Takanami, I.: A note on decision problems for three-way two-dimensional finite automata. Inf. Process. Lett. 10(4/5), 245–248 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  6. Inoue, K., Takanami, I.: A survey of two-dimensional automata theory. Inf. Sci. 55(1-3), 99–121 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  7. Inoue, K., Takanami, I., Taniguchi, H.: Two-dimensional alternating turing machines. Theor. Comput. Sci. 27, 61–83 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  8. Ito, A., Inoue, K., Takanami, I.: A note on three-way two-dimensional alternating turing machines. Inf. Sci. 45(1), 1–22 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  9. Ito, A., Inoue, K., Takanami, I.: Deterministic two-dimensional on-line tessellation acceptors are equivalent to two-way two-dimensional alternating finite automata through 180-rotation. Theor. Comput. Sci. 66(3), 273–287 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  10. Ito, A., Inoue, K., Takanami, I., Taniguchi, H.: Two-dimensional alternating turing machines with only universal states. Information and Control 55(1-3), 193–221 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  11. Kari, J., Moore, C.: New results on alternating and non-deterministic two-dimensional finite-state automata. In: Ferreira, A., Reichel, H. (eds.) STACS 2001. LNCS, vol. 2010, pp. 396–406. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  12. Kari, J., Moore, C.: Rectangles and squares recognized by two-dimensional automata. In: Karhumäki, J., Maurer, H., Păun, G., Rozenberg, G. (eds.) Theory Is Forever. LNCS, vol. 3113, pp. 134–144. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  13. Kinber, E.B.: Three-way automata on rectangular tapes over a one-letter alphabet. Inf. Sci. 35(1), 61–77 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  14. Ladner, R.E., Lipton, R.J., Stockmeyer, L.J.: Alternating pushdown and stack automata. SIAM J. Comput. 13(1), 135–155 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  15. Lindgren, K., Moore, C., Nordahl, M.: Complexity of two-dimensional patterns. Journal of Statistical Physics 91, 909–951 (1998), http://dx.doi.org/10.1023/A:1023027932419

    Article  MathSciNet  MATH  Google Scholar 

  16. Minsky, M.L.: Computation: finite and infinite machines. Prentice-Hall, Inc., Englewood Cliffs (1967)

    MATH  Google Scholar 

  17. Okazaki, T., Zhang, L., Inoue, K., Ito, A., Wang, Y.: A note on two-dimensional probabilistic finite automata. Inf. Sci. 110(3-4), 303–314 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  18. Parikh, R.: On context-free languages. J. ACM 13(4), 570–581 (1966)

    Article  MathSciNet  MATH  Google Scholar 

  19. Petersen, H.: Some results concerning two-dimensional turing machines and finite automata. In: Reichel, H. (ed.) FCT 1995. LNCS, vol. 965, pp. 374–382. Springer, Heidelberg (1995)

    Chapter  Google Scholar 

  20. Reinhardt, K.: On some recognizable picture-languages. In: Brim, L., Gruska, J., Zlatuška, J. (eds.) MFCS 1998. LNCS, vol. 1450, pp. 760–770. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  21. Rosenfeld, A.: Picture Languages: Formal Models for Picture Recognition. Academic Press, Inc., Orlando (1979)

    MATH  Google Scholar 

  22. Salo, V.: Classes of picture languages defined by tiling systems, automata and closure properties. Master’s thesis, University of Turku (2011)

    Google Scholar 

  23. Sipser, M.: Halting space-bounded computations. In: FOCS, pp. 73–74. IEEE, Los Alamitos (1978)

    Google Scholar 

  24. Szepietowski, A.: Some remarks on two-dimensional finite automata. Inf. Sci. 63(1-2), 183–189 (1992)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Turku, FI-20014, Turku, Finland

    Jarkko Kari & Ville Salo

Authors
  1. Jarkko Kari
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ville Salo
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Diskrete Mathematik und Geometrie, Technische Universität Wien, Austria

    Werner Kuich

  2. Department of Mathematics, Aristotle University of Thessaloniki, 54124, Thessaloniki, Greece

    George Rahonis

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Kari, J., Salo, V. (2011). A Survey on Picture-Walking Automata. In: Kuich, W., Rahonis, G. (eds) Algebraic Foundations in Computer Science. Lecture Notes in Computer Science, vol 7020. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24897-9_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-24897-9_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-24896-2

  • Online ISBN: 978-3-642-24897-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation