Summary
A two-dimensional (2-d) language is a set of 2-d arrays of symbols, whose theories give the mathematical foundation for 2-d information processing. There are various formal methods for treating 2-d languages. They can be classified into two types, i.e., methods based on 2-d automata, and those of 2-d grammars (or pattern generating systems).
In the first section, basic notions on 2-d languages are given. Then, in the second and third sections, automata-theoretic approaches and 2-d grammar formalisms are described and discussed. Fundamental results on them and some open problems are surveyed. Comparison with the one-dimensional case is also made.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Beyer, T.: Recognition of topological invariants by iterative arrays. Ph.D. thesis, MIT 1969.
Blum, M., Hewitt, C.: Automata on a two-dimensional tape. In Proc. IEEE Symposium on Switching and Automata Theory, (1967), pp 155–160.
Cook, C.R., Wang, P.S.P.: A Chomsky hierarchy of isotonic array grammars and languages, Computer Graphics and Image Processing, 8 (1978), 144–152.
Giammarresi, D., Restivo, A.: Two-dimensional languages. In G. Rozenberg, A. Salomaa (Eds.) Handbook of Formal Languages, Vol..9 ( Springer, Berlin, 1997 ).
Hoperoft, J.E., Ullman, J.D.: Some results on tape-bounded Turing machines. J. ACM, 16 (1969), 168–177.
Inoue, K., Takanami, I.: A survey of two-dimensional automata theory. Information Sciences, 55 (1991), 99–121.
Milgram, D.L., Rosenfeld, A.: Array automata and array grammars, Information Processing, 71 (1972), 69–74.
Morita, K., Umeo, H., Ebi, H., Sugata, K.: Lower bounds on tape complexity of two-dimensional tape Turing machines (in Japanese), Trans. IECE Japan, 61-D (1978), 381–386.
Rosenfeld, A.: Picture Languages (Academic Press, New York 1979 ).
Siromoney, G., Siromoney, R., Krithivasan, K.: Picture languages with array rewriting rules, Information and Control, 22 (1973), 447–470.
Wang, P.S.P. (Ed.): Array Grammars, Patterns and Recognizers ( World Scientific, Singapore 1989 ).
Yamamoto, Y., Morita, K., Sugata, K.: Context-sensitivity of two-dimensional regular array grammars. Int. J. Pattern Recognition and Artificial Intelligence, 3 (1989), 295–319.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Morita, K. (2004). Two-Dimensional Languages. In: MartÃn-Vide, C., Mitrana, V., Păun, G. (eds) Formal Languages and Applications. Studies in Fuzziness and Soft Computing, vol 148. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39886-8_22
Download citation
DOI: https://doi.org/10.1007/978-3-540-39886-8_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-53554-3
Online ISBN: 978-3-540-39886-8
eBook Packages: Springer Book Archive