Two-dimensional sgraffito automata

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7410 LNCS, Issue , 2012, Pages 251-262

  Průša, Daniel ^a   Mráz, František ^b  

^a CZECH TECHNICAL UNIVERSITY IN PRAGUE   (Czech Republic)

^b CHARLES UNIVERSITY   (Czech Republic)

Author keywords

bounded Turing machine; REC; sgraffito automaton; two dimensional languages

Indexed keywords

COMPUTING DEVICES; FINITE-STATE AUTOMATA; PICTURE LANGUAGES; REC; SGRAFFITO AUTOMATON; TWO-DIMENSIONAL LANGUAGES;

TURING MACHINES;

TWO DIMENSIONAL;

EID: 84865024359     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-31653-1_23     Document Type: Conference Paper

References (10)

1. Anselmo, M., 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. LNCS, vol. 4588, pp. 36-47. Springer, Heidelberg (2007)
2. Blum, M., Hewitt, C.: Automata on a 2-dimensional tape. In: Proceedings of the 8th Annual Symposium on Switching and Automata Theory (SWAT 1967), FOCS 1967, pp. 155-160. IEEE Computer Society, Washington, DC (1967)
3. Giammarresi, D., Restivo, A.: Recognizable picture languages. International Journal of Pattern Recognition and Artificial Intelligence 6(2-3), 32-45 (1992)
4. Giammarresi, D., Restivo, A.: Two-dimensional languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. 3, pp. 215-267. Springer-Verlag New York, Inc., New York (1997)
5. Hennie, F.: One-tape, off-line Turing machine computations. Information and Control 8(6), 553-578 (1965)
6. Hopcroft, J., Ullman, J.: Formal languages and their relation to automata. Addison-Wesley (1969)
7. Inoue, K., Nakamura, A.: Some properties of two-dimensional on-line tessellation acceptors. Information Sciences 13, 95-121 (1977)
8. 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.) Developments in Language Theory, pp. 71-80. World Scientific (1999)
9. 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)
10. Lindgren, K., Moore, C., Nordahl, M.: Complexity of two-dimensional patterns. Journal of Statistical Physics 91(5-6), 909-951 (1998)