On the complexity of unary tiling-recognizable picture languages

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

Volumn 4393 LNCS, Issue , 2007, Pages 381-392

  Bertoni, Alberto ^a   Goldwurm, Massimiliano ^a   Lonati, Violetta ^a  

^a UNIVERSITY OF MILAN   (Italy)

Author keywords

Tiling systems; Turing machine head reversal; Unary picture languages

Indexed keywords

BINARY CODES; IMAGE CODING; THEOREM PROVING;

TILING SYSTEMS; TURING MACHINE HEAD REVERSAL; UNARY PICTURE LANGUAGES;

PATTERN RECOGNITION;

EID: 38149016997     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-70918-3_33     Document Type: Conference Paper

References (12)

1. M. Agrawal, N. Kayal, N. Saxena. PRIMES is in P. Annals of Mathematics, 160(2): 781-793, 2004.
2. M. Anselmo, D. Giammarresi, M. Madonia. Regular expressions for two-dimensional languages over one-letter alphabet. In Proc. 8th DLT, C.S. Calude, E. Calude and M.J. Dinneen (Eds.), LNCS 3340, 63-75, Springer-Verlag, 2004.
3. D. Giammarresi, A. Restivo. Recognizable picture languages. Int. J. Pattern Recognition and Artificial Intelligence, Special Issue on Parallel Image Processing, 31-42, 1992.
4. D. Giammarresi, A. Restivo. Two-dimensional languages. In Handbook of Formal Languages, G. Rosenberg and A. Salomaa (Eds.), Vol. III, 215-268, Springer-Verlag, 1997.
5. D. Giammarresi, A. Restivo, S. Seibert, W. Thomas. Monadic second order logic over rectangular pictures and recognizability by tiling system. Information and Computation, 125(1):32-45, 1996.
6. K. Inoue, I. Takanami. A survey of two-dimensional automata theory. In Proc. 5th Int. Meeting of Young Computer Scientists, J. Dasson, J. Kelemen (Eds.), LNCS 381, 72-91, Springer-Verlag, 1990.
7. J. Kari, C. Moore. New results on alternating and non-deterministic two-dimensional finite state automata. In Proc. 18th STACS, A. Ferreira, H. Reichel (Eds.), LNCS 2010, 396-406, Springer-Verlag, 2001.
8. O. Matz. Regular expressions and context-free grammars for picture languages. In Proc. 14th STACS, LNCS 1200, 283 294, Springer-Verlag, 1997.
9. A.R. Meyer and L.J. Stockmeyer. The equivalence problem for regular expressions with squaring requires exponential space. Proc. 13th Annual IEEE Symp. on Switching and Automata Theory 125-129, 1972.
10. A.R. Meyer and L.J. Stockmeyer. Words problems requiring exponential time. Proc 5th ACM Symp. on Theory of Computing 1-9, 1973.
11. J. I. Seiferas, M. J. Fischer, A. R. Meyer. Separating nondeterministic time complexity classes. Journal of ACM, 25(1): 146-167, 1978.
12. R. Siromoney. Advances in array languages. In Graph-grammars and their applications to Computer Science, Ehrig et al. Eds., LNCS 291, 549-563, Springer-Verlag, 1987.