Skip to main content
SpringerLink
Log in

Deterministic ordered restarting automata for picture languages

  • Original Article
  • Published:
Acta Informatica Aims and scope Submit manuscript

Abstract

The ordered restarting automaton (processing strings) is introduced, and it is shown that its nondeterministic variant is very expressive, as it accepts some languages that are not even context-free, while the deterministic ordered restarting automata just accept the regular languages. Then three different extensions of the deterministic ordered restarting automaton to two-dimensional inputs are defined that differ in the way in which they can move their read/write windows. We compare the classes of picture languages that these types of automata accept to each other and to some well studied classes of picture languages from the literature, and we present some closure and non-closure properties for them.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3

Similar content being viewed by others

References

  1. Anselmo, A., Giammarresi, D., Madonia, M.: From determinism to non-determinism in recognizable two-dimensional languages. In: Harju, T., Karhumäki, J., Lepistö, A. (eds.) DLT 2007, Proceedings, Lecture Notes on Computer Science, vol. 4588, pp. 36–47. Springer, Heidelberg (2007)

  2. Anselmo, A., Giammarresi, D., Madonia, M.: A computational model for tiling recognizable two-dimensional languages. Theor. Comput. Sci. 410, 3520–3529 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  3. Anselmo, A., Giammarresi, D., Madonia, M.: Deterministic and unambiguous families within recognizable two-dimensional languages. Fundam. Inform. 98, 143–166 (2010)

    MATH  MathSciNet  Google Scholar 

  4. Blum, M., Hewitt, C.: Automata on a 2-dimensional tape. In: SWAT 1967, Proceedings, pp. 155–160. IEEE Computer Society, Washington, DC, USA (1967)

  5. Borchert, B., Reinhardt, K.: Deterministically and sudoku-deterministically recognizable picture languages. In: Loos, R., Fazekas, S., Martín-Vide, C. (eds.) LATA 2007, Preproceedings, Report 35/07, pp. 175–186. Research Group on Mathematical Linguistics, Universitat Rovira i Virgili, Tarragona (2007)

  6. Giammarresi, D., Restivo, A.: Recognizable picture languages. Int. J. Pattern Recognit. Artif. Intell. 6(2–3), 241–256 (1992)

    Article  Google Scholar 

  7. Giammarresi, D., Restivo, A.: Two-dimensional languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. 3, pp. 215–267. Springer, New York (1997)

    Chapter  Google Scholar 

  8. Hennie, F.: One-tape, off-line Turing machine computations. Inf. Control 8(6), 553–578 (1965)

    Article  MathSciNet  Google Scholar 

  9. Inoue, K., Nakamura, A.: Some properties of two-dimensional on-line tessellation acceptors. Inf. Sci. 13, 95–121 (1977)

    Article  MATH  MathSciNet  Google Scholar 

  10. Jančar, P., Mráz, F., Plátek, M.: Characterization of context-free languages by erasing automata. In: Havel, I., Koubek, V. (eds.) MFCS 1992, Proceedings, Lecture Notes on Computer Science, vol. 629, pp. 307–314. Springer, Heidelberg (1992)

  11. Jančar, P., Mráz, F., Plátek, M., Vogel, J.: Restarting automata. In: Reichel, H. (ed.) FCT’95, Proceedings, Lecture Notes on Computer Science, vol. 965, pp. 283–292. Springer, Heidelberg (1995)

  12. Jiřička, P., Král, J.: Deterministic forgetting planar automata are more powerful than non-deterministic finite-state planar automata. In: Rozenberg, G., Thomas, W. (eds.) DLT 1999, Proceedings, pp. 71–80. World Scientific, Singapore (2000)

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

  14. Lindgren, K., Moore, C., Nordahl, M.: Complexity of two-dimensional patterns. J. Stat. Phys. 91(5–6), 909–951 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  15. Lonati, V., Pradella, M.: Picture recognizability with automata based on Wang tiles. In: Leeuwen, J.V., Muscholl, A., Peleg, D., Pokorný, J., Rumpe, B. (eds.) SOFSEM 2010, Proceedings, Lecture Notes on Computer Science, vol. 5901, pp. 576–587. Springer, Heidelberg (2010)

  16. Messerschmidt, H., Stommel, M.: Church–Rosser picture languages and their applications in picture recognition. J. Autom. Lang. Comb. 16, 165–194 (2011)

    Google Scholar 

  17. Mráz, F., Otto, F.: Extended two-way ordered restarting automata for picture languages. In: Dediu, A.H., Martín-Vide, C., Sierra-Rodríguez, J., Truthe, B. (eds.) LATA 2014, Proceedings, Lecture Notes on Computer Science, vol. 8370, pp. 541–552. Springer, Heidelberg (2014)

  18. Mráz, F., Otto, F.: Ordered restarting automata for picture languages. In: Geffert, V., Preneel, B., Rovan, B., Štuller, J., Min Tjoa, A. (eds.) SOFSEM 2014, Proceedings, Lecture Notes on Computer Science, vol. 8327, pp. 431–442. Springer, Heidelberg (2014)

  19. Otto, F.: Restarting automata. In: Ésik, Z., Martín-Vide, C., Mitrana, V. (eds.) Recent Advances in Formal Languages and Applications, Studies in Computational Intelligence, vol. 25, pp. 269–303. Springer, Heidelberg (2006)

    Google Scholar 

  20. Otto, F.: On the descriptional complexity of deterministic ordered restarting automata. In: Jürgensen, H., Karhumäki, J., Okhotin, A. (eds.) DCFS 2014, Proceedings, Lecture Notes on Computer Science, vol. 8614, pp. 318–329. Springer, Heidelberg (2014)

  21. Otto, F.: Restarting automata for picture languages: a survey on recent developments. In: Holzer, M., Kutrib, M. (eds.) CIAA 2014, Proceedings, Lecture Notes on Computer Science, vol. 8587, pp. 16–41. Springer, Heidelberg (2014)

  22. Průša, D., Mráz, F., Otto, F.: Two-dimensional Sgraffito automata. RAIRO Theor. Inform. Appl. 48, 505–539 (2014)

    Article  MathSciNet  Google Scholar 

  23. Průša, D., Mráz, F.: Restarting tiling automata. In: Moreira, N., Reis, R. (eds.) CIAA 2012, Proceedings, Lecture Notes on Computer Science, vol. 7381, pp. 289–300. Springer, Heidelberg (2012)

  24. Průša, D., Mráz, F.: Two-dimensional sgraffito automata. In: Yen, H., Ibarra, O. (eds.) DLT 2012, Proceedings, Lecture Notes on Computer Science, vol. 7410, pp. 251–262. Springer, Heidelberg (2012)

  25. Průša, D., Mráz, F.: Restarting tiling automata. Int. J. Found. Comput. Sci. 24(6), 863–878 (2013)

    Article  MATH  Google Scholar 

  26. Průša, D., Mráz, F., Otto, F.: Comparing two-dimensional one-marker automata to sgraffito automata. In: Konstantinidis, S. (ed.) CIAA 2013, Proceedings, Lecture Notes on Computer Science, vol. 7982, pp. 268–279. Springer, Heidelberg (2013)

  27. Průša, D., Mráz, F., Otto, F.: New results on deterministic sgraffito automata. In: Béal, M., Carton, O. (eds.) DLT 2013, Proceedings, Lecture Notes on Computer Science, vol. 7907, pp. 409–419. Springer, Heidelberg (2013)

  28. Rosenfeld, A.: Isotonic grammars, parallel grammars, and picture grammars. In: Meltzer, B., Michie, D. (eds.) Machine Intelligence, vol. 6, pp. 281–294. Edinburgh University Press, Edinburgh (1971)

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich Elektrotechnik/Informatik, Universität Kassel, 34109, Kassel, Germany

    Friedrich Otto

  2. Faculty of Mathematics and Physics, Department of Computer Science, Charles University, 118 00, Praha 1, Czech Republic

    František Mráz

Authors
  1. Friedrich Otto
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. František Mráz
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Friedrich Otto.

Additional information

František Mráz was supported by the Grant Agency of the Czech Republic under the project 15-04960S. Some of the results of this paper have been announced at the 40-th International Conference on Current Trends in Theory and Practise of Computer Science (SOFSEM 2014) at Nový Smokovec, Slovakia, January 2014, and at the 8-th International Conference on Language and Automata Theory and Applications (LATA 2014) at Madrid, Spain, March 2014. Extended abstracts appeared in the proceedings of these conferences [17, 18].

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Otto, F., Mráz, F. Deterministic ordered restarting automata for picture languages. Acta Informatica 52, 593–623 (2015). https://doi.org/10.1007/s00236-015-0230-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00236-015-0230-5

Mathematics Subject Classification

Search

Navigation