Star-free picture expressions are strictly weaker than first-order logic

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

Volumn 1256, Issue , 1997, Pages 347-357

  Wilke, Thomas ^a  

^a UNIVERSITY OF KIEL   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COMPUTER CIRCUITS; FORMAL LOGIC;

COMBINATORICS ON WORDS; EXPRESSIBILITY; FIRST ORDER; FIRST ORDER LOGIC; FIRST-ORDER FORMULAS; PICTURE LANGUAGES; SHARP CONTRAST; WORD LANGUAGES;

STARS;

EID: 21744460612     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63165-8_191     Document Type: Conference Paper

References (10)

1. J. R. Biichi. Weak second-order arithmetic and finite automata. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, 6:66-92, 1960.
2. H.-D. Ebbinghaus, J. Flum, and W. Thomas. Mathematical Logic. Springer-Verlag, New York, 1984.
3. R. Fraíssé. Sur quelques classifications des relations, bases sur des isomorphismes restreints, Publ. Sci. de l'Univ. Alger, Ser. A 1, pp. 35-182, 1954.
4. D. Giammarresi and A. Restivo. Two-dimensional languages, in G. Rozenberg and A. Salomaa, ed., Handbook of Formal Languages. Springer- Verlag, Berlin. To appear. Preprint available as: http://www.dsi.unive.it/%7Edora/Papers/chap96.ps.Z.
5. D. Giammarresi and A. Restivo. Two-dimensional finite state recognizability. Fundamenta Informaticae. To appear.
6. D. Giammarresi, A. Restivo, S. Seibert, and W. Thomas. Monadic second-order logic over rectangular pictures and recognizability by tiling systems. Inform, and Comput., 125(l):32-45, 1996.
7. N. Immerman and D. Kozen. Definability with bounded number of bound variables. Inform, and Comput., 83(2):121-139, 1989.
8. H. A. Maurer, G. Rozenberg, and E. Welzl. Using string languages to describe picture languages. Inform, and Control, 54(3):155-185, 1982.
9. R. McNaughton and S. Papert Counter-Free Automata, vol. 69 of Research Monograph. MIT Press, Cambridge, Mass., 1971.
10. W. Thomas. A concatenation game and the dot-depth hierarchy. In E. Borger, editor, Computation Theory and Logic, volume 270 of Lecture Notes in Comput. Science, pages 415-426. Springer-Verlag, 1987.