Skip to main content
SpringerLink
Log in

Rectangles and Squares Recognized by Two-Dimensional Automata

  • Chapter
Book cover Theory Is Forever

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

Abstract

We consider sets of rectangles and squares recognized by deterministic and non-deterministic two-dimensional finite-state automata. We show that sets of squares recognized by DFAs from the inside can be as sparse as any recursively enumerable set. We also show that NFAs can only recognize sets of rectangles from the outside that correspond to simple regular languages.

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. Blum, M., Hewitt, C.: Automata on a 2-dimensional tape. In: 8th IEEE Symp. on Switching and Automata Theory, pp. 155–160 (1967)

    Google Scholar 

  2. Borchert, B.: http://math.uni-heidelberg.de/logic/bb/2dpapers.html

  3. Giammarresi, D., Restivo, A.: Recognizable picture languages. Int. J. of Pattern Recognition and Artificial Intelligence 6(2-3), 241–256 (1992)

    Article  Google Scholar 

  4. Giammarresi, D., Restivo, A.: Two-dimensional languages. In: Rosenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. III, pp. 215–267. Springer, Heidelberg (1996)

    Google Scholar 

  5. Inoue, K., Nakamura, A.: Some properties of two-dimensional on-line tesselation acceptors. Information Sciences 13, 95–121 (1977)

    Article  MathSciNet  Google Scholar 

  6. Inoue, K., Nakamura, A.: Two-dimensional finite automata and unacceptable functions. Int. J. Comput. Math. A 7, 207–213 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  7. Inoue, K., Takanami, I.: A survey of two-dimensional automata theory. Information Sciences 55, 99–121 (1991)

    Article  MATH  MathSciNet  Google Scholar 

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

    Chapter  Google Scholar 

  9. Lindgren, K., Moore, C., Nordahl, M.G.: Complexity of two-dimensional patterns. Journal of Statistical Physics 91, 909–951 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  10. Milgram, D.L.: A region crossing problem for array-bounded automata. Information and Control 31, 147–152 (1976)

    Article  MATH  MathSciNet  Google Scholar 

  11. Minsky, M.: Computation: Finite and Infinite Machines. Prentice-Hall, Englewood Cliffs (1967)

    MATH  Google Scholar 

  12. Rosenfeld, A.: Picture Languages: Formal Models for Picture Recognition. Academic Press, London (1979)

    MATH  Google Scholar 

  13. Sipser, M.: Halting space-bounded computations. Theoretical Computer Science 10, 335–338 (1980)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Jarkko Kari

  2. Department of Computer Science, University of Iowa, Iowa City, IA, 52242, USA

    Jarkko Kari

  3. Computer Science Department and Department of Physics and Astronomy, University of New Mexico, Albuquerque, NM, 87131

    Cristopher Moore

  4. the Santa Fe Institute, 1399 Hyde Park Road, Santa Fe, NM, 87501

    Cristopher Moore

Authors
  1. Jarkko Kari
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Cristopher Moore
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

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

    Juhani Karhumäki

  2. Institute for Information Systems and Computer Media (IICM), Graz University of Technology, A-8010, Graz, Austria

    Hermann Maurer

  3. Institute of Mathematics of the Romanian Academy, PO Box 1-764, 014700, BucureÅŸti, Romania

    Gheorghe Păun

  4. Leiden Center of Advanced Computer Science (LIACS), Leiden University, Niels Bohrweg 1, 2333, Leiden, CA, The Netherlands

    Grzegorz Rozenberg

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Kari, J., Moore, C. (2004). Rectangles and Squares Recognized by Two-Dimensional Automata. In: Karhumäki, J., Maurer, H., Păun, G., Rozenberg, G. (eds) Theory Is Forever. Lecture Notes in Computer Science, vol 3113. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27812-2_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-27812-2_13

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-27812-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation