Monadic Second-Order Logic over Rectangular Pictures and Recognizability by Tiling Systems

Information and Computation

Volumn 125, Issue 1, 1996, Pages 32-45

  Giammarresi, Dora ^a   Restivo, Antonio ^b   Seibert, Sebastian ^c   Thomas, Wolfgang ^c  

^a UNIVERSITY OF L'AQUILA   (Italy)

^b UNIVERSITY OF PALERMO   (Italy)

^c UNIVERSITY OF KIEL   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0003023825     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1996.0018     Document Type: Article

References (19)

1. Blum, B., and Hewitt, C. (1967), Automata on a two-dimensional tape, in "IEEE Symposium on Switching and Automata Theory," pp. 155-160.
2. Bossut, F., Dauchet, M., and Warin, B. (1995), A Kleene Theorem for a class of planar acyclic graphs, Inform. and Comput. 117, 251-265.
3. Courcelle, B. (1990), The monadic second-order theory of graphs. I. Recognizable sets of finite graphs, Inform. and Comput. 85, 12-75.
4. Eilenberg, S. (1974), "Automata, Languages and Machines," Vol. A, Academic Press, New York.
5. Ebbinghaus, H. D., Flum, J., and Thomas, W. (1994), "Mathematical Logic" 2nd ed., Springer-Verlag/Berlin/Heidelberg/New York.
6. Fagin, R. (1975), Monadic generalized spectra, Z. math. Logik Grundl. Math. 21, pp. 89-96.
7. Fagin, R., Stockmeyer, L., and Vardi, M. Y. (1993), On monadic NP vs. monadic co-NP, in "Proc. 8th IEEE Conf. on Structure in Complexity Theory," pp. 19-30.
8. Giammarresi, D., and Restivo, A. (1992), Recognizable picture languages, in "Proc. First International Colloquium on Parallel Image Processing, 1991," Internat. J. Pattern Recognition and Artificial Intelligence, 6, Nos. 2 & 3, 241-256; also in the special issue "Parallel Image Processing" (M. Nivat, A. Saoudi, and P. S. P. Wang, Eds.), World Scientific, Series in Machine Perception and Artificial Intelligence, Singapore, pp. 31-46.
9. Giammarresi, D., and Restivo, A. (1992), Recognizable picture languages, in "Proc. First International Colloquium on Parallel Image Processing, 1991," Internat. J. Pattern Recognition and Artificial Intelligence, 6, Nos. 2 & 3, 241-256; also in the special issue "Parallel Image Processing" (M. Nivat, A. Saoudi, and P. S. P. Wang, Eds.), World Scientific, Series in Machine Perception and Artificial Intelligence, Singapore, pp. 31-46.
10. Giammarresi, D., and Restivo, A., Two-dimensional finite state recognizability. Fund. Inform., to appear.
11. Hanf, W. P. (1965), Model-theoretic methods in the study of elementary logic, in "The Theory of Models" (J. W. Addison, L. Henkin, and A. Tarski, Eds.), pp. 132-145, North-Holland, Amsterdam.
12. Hopcroft, J. E., and Ullman, J. D. (1979), "Introduction to Automata Theory, Languages and Computation," Addison-Wesley, Reading, MA.
13. Inoue, K., and Nakamura, A. (1977), Some properties of two-dimensional on-line tessellation acceptors. Inform. Sci. 13, 95-121.
14. Inoue, K., and Nakamura, A. (1977), Nonclosure properties of two-dimensional on-line tessellation acceptors and one-way parallel/ sequential array acceptors. Trans. of IECE of Japan 6, 475-476.
15. Inoue, I., and Takanami, I. (1990), A survey of two-dimensional automata theory, in "Proc. 5th Int. Meeting of Young Computer Scientists" (J. Dassow and J. Kelemen, Eds.), pp. 72-91, Lecture Notes in Computer Science, Vol. 381, Springer-Verlag, Berlin.
16. Inoue, K., and Takanami, I. (1992), A characterization of recognizable picture languages, in "Proc. Second International Colloquium on Parallel Image Processing" (A. Nakamura et al., Eds.), Lecture Notes in Computer Science, Vol. 654, Springer-Verlag, Berlin.
17. Potthoff, A., Seibert, S., and Thomas, W. (1994), Nondeterminism versus determinism of finite automata over directed acyclic graphs, Bull. Belg. Math. Soc. 1, 285-298.
18. Straubing, H. (1994), "Finite Automata, Formal Logic, and Circuit Complexity," Birkhäuser, Boston.
19. Thomas, W. (1991), On logics, tilings, and automata, in "Proc. 18th Int. Colloquium on Automata, Languages and Programming," Lecture Notes in Computer Science, Vol. 510, pp. 441-453, Springer-Verlag, Berlin.