Automatic structures

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2000, Pages 51-62

  Blumensath, Achim ^a   Graedel, Erich ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; AUTOMATA THEORY; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL LINGUISTICS; COMPUTER SIMULATION; FORMAL LOGIC; QUERY LANGUAGES; SET THEORY; THEOREM PROVING;

AUTOMATIC GROUPS; AUTOMATIC STRUCTURES; FIRST ORDER LOGIC;

DATA STRUCTURES;

EID: 0033700293     PISSN: 10436871     EISSN: None     Source Type: Journal    
DOI: 10.1109/LICS.2000.855755     Document Type: Article

References (23)

1. S. Abiteboul R. Hull V. Vianu Foundations of Databases 1995 Addison-Wesley
2. A. Blumensath Automatic Structures 1999 RWTH Aachen
3. B. Boigelot S. Rassart P. Wolper On the expressiveness of real and integer arithmetic automata Proc. 25th Int. Colloq. on Automata, Languages and Programming 1443 152 163 Proc. 25th Int. Colloq. on Automata, Languages and Programming 1998
4. V. Bruyère G. Hansel C. Michaux R. Villemaire Logic and p-recognizable sets of integers Bull. Belg. Math. Soc. 1 191 238 1994
5. S. Buss The boolean formula value problem is in Alog-time Proc. 19th ACM Symp. on the Theory of Computing 123 131 Proc. 19th ACM Symp. on the Theory of Computing 1987
6. H.-D. Ebbinghaus J. Flum Finite Model Theory 1995 Springer
7. S. Eilenberg Automata, Languages, and Machines A 1974 Academic Press New York
8. C. C. Elgot J. E. Mezei On relations defined by generalized finite automata IBM J. Res. Develop. 9 47 68 1965
9. D. Epstein J. Cannon D. Holt S. Levy M. Paterson W. Thurston Word Processing in Groups 1992 Jones and Bartlett Publishers Boston
10. B. Farb Automatic groups: A guided tour L' Enseignement Mathématique 38 291 313 1992
11. E. Grädel Simple interpretations among complicated theories Inf. Process. Lett. 35 235 238 1990
12. E. Grädel Y. Gurevich Metafinite model theory Information and Computation 140 26 81 1998
13. Y. Gurevich Model-Theoretic Logics 479 506 1985 Springer Monadic second-order theories
14. D. Harel Towards a theory of recursive structures Proc. 23rd Int. Symp. on Mathematical Foundations of Computer Science 1450 36 53 Proc. 23rd Int. Symp. on Mathematical Foundations of Computer Science 1998
15. T. Hirst D. Harel More about recursive structures: Descriptive complexity and zero-one laws Proc. 11th IEEE Symp. on Logic in Computer Science 334 348 Proc. 11th IEEE Symp. on Logic in Computer Science 1996
16. W. Hodges Model Theory 1993 Cambridge University Press
17. H. Hunt D. Rosenkrantz T. Szymanski On the equivalence, containment, and covering problems for the regular and context-free languages J. Comput. Syst. Sci. 12 222 268 1976
18. N. Immerman Descriptive complexity 1998 Springer
19. B. Khoussainov A. Nerode Automatic presentations of structures LNCS 960 367 392 1995
20. G. Kuper L. Libkin Constraint Databases 1999 Springer
21. A. R. Meyer L. J. Stockmeyer Word problems requiring exponential time Proc. 5th ACM Symp. on the Theory of Computing 1 9 Proc. 5th ACM Symp. on the Theory of Computing 1973
22. A. Stolboushkin Towards recursive model theory Lecture Notes in Logic 11 325 338 1998
23. W. Thomas Ehrenfeucht games, the composition method, and the monadic theory of ordinal words LNCS 1261 118 143 1997