Skip to main content

Part of the book series: Lecture Notes in Computer Science ((LNIP,volume 10149))

  • 515 Accesses

Abstract

We are systematically discussing finite automata working on rectangular-shaped arrays (i.e., pictures), reading them with different scanning strategies. We show that all 32 different variants only describe two different classes of array languages. We also introduce and discuss Mealy machines working on pictures and show how these can be used in a modular design of picture processing devices.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

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 EPUB and 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

Notes

  1. 1.

    We could also use the unary operations and their inverses to formally describe the processing.

References

  1. Armstrong, M.A.: Groups and Symmetry. Springer, Heidelberg (1988)

    Book  MATH  Google Scholar 

  2. Fernau, H., Paramasivan, M., Schmid, M.L., Thomas, D.G.: Scanning pictures the boustrophedon way. In: Barneva, R.P., Bhattacharya, B.B., Brimkov, V.E. (eds.) IWCIA 2015. LNCS, vol. 9448, pp. 202–216. Springer, Heidelberg (2015). doi:10.1007/978-3-319-26145-4_15

    Chapter  Google Scholar 

  3. Flasiński, M.: Syntactic pattern recognition: paradigm issues and open problems. In: Chen, C.H. (ed.) Handbook of Pattern Recognition and Computer Vision, 5th edn., pp. 3–25. World Scientific (2016)

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  5. Kari, J., Salo, V.: A survey on picture-walking automata. In: Kuich, W., Rahonis, G. (eds.) Algebraic Foundations in Computer Science. LNCS, vol. 7020, pp. 183–213. Springer, Heidelberg (2011). doi:10.1007/978-3-642-24897-9_9

    Chapter  Google Scholar 

  6. Siromoney, G., Siromoney, R., Krithivasan, K.: Abstract families of matrices and picture languages. Comput. Graph. Image Process. 1, 284–307 (1972)

    Article  MathSciNet  MATH  Google Scholar 

  7. Siromoney, G., Siromoney, R., Krithivasan, K.: Picture languages with array rewriting rules. Inf. Control (now Inf. Comput.) 22(5), 447–470 (1973)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Meenakshi Paramasivan .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Fernau, H., Paramasivan, M., Thomas, D.G. (2017). Picture Scanning Automata. In: Barneva, R., Brimkov, V., Tavares, J. (eds) Computational Modeling of Objects Presented in Images. Fundamentals, Methods, and Applications. CompIMAGE 2016. Lecture Notes in Computer Science(), vol 10149. Springer, Cham. https://doi.org/10.1007/978-3-319-54609-4_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-54609-4_10

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-54608-7

  • Online ISBN: 978-3-319-54609-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics