Representing constraints with automata

Proceedings of the Annual Meeting of the Association for Computational Linguistics

Volumn 1997-July, Issue , 1997, Pages 468-475

  Morawietz, Frank ^a   Cornell, Tom ^a  

^a UNIVERSITY OF TÜBINGEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COMPUTER PROGRAMMING LANGUAGES; CONSTRAINT PROGRAMMING; SYNTACTICS;

CONSTRAINT LOGIC PROGRAMMING; CONSTRAINT-BASED; EMBEDDINGS; FINITE TREE AUTOMATON; MONADIC SECOND-ORDER LOGIC; SYNTACTIC THEORY; TREE AUTOMATA; WEAK MONADIC SECOND-ORDER LOGIC;

COMPUTER CIRCUITS;

EID: 33644610218     PISSN: 0736587X     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. Ayari, A., Basin, D. and Podelski, A. (1997). LISA: A specification language based on WS2S, Ms, Universit~it Freiburg. Submitted to CSL'97.
2. Basin, D. and Klarlund, N. (1995). Hardware verification using monadic second-order logic, Computer-Aided Verification (CAV '95), LNCS 939, Springer, pp. 31-41.
3. Biehl, M., Klarlund, N. and Rauhe, T. (1996). Algorithms for guided tree automata, Proc. WIA '96, LNCS, Springer-Verlag.
4. Biichi, J. R. (1960). Weak second-order arithmetic and finite automata, Zeitschrift fiir mathematisehe Logik und Grundlagen der Mathematik 6: 66-92.
5. Doner, J. (1970). Tree acceptors and some of their applications, Journal of Computer and System Sciences 4: 406-451.
6. Frank, R. and Vijay-Shanker, K. (1995). C-command and grammatical primitives, Presentation at the 18th GLOW Colloquium. University of Troms0.
7. G@cseg,F. and Steinby, M. (1984). TreeAutomata, Akad~miai Kiad6, Budapest.
8. Henriksen, J. G., Jensen, J., J¢rgensen, M., Klarlund, N., Paige, R., Rauhe, T. and Sandhol, A. (1995). MONA: Monadic second-order logic in practice, in Brinksma, Cleaveland, Larsen, Margaria and Steffen (eds), TACAS '95, LNCS 1019, Springer, pp. 89-110.
9. HShfeld, M. and Smolka, G. (1988). Definite relations over constraint languages, LILOG Report 53, IBM Deutschland, Stuttgart, Germany.
10. Johnson, M. (1994). Two ways of formalizing grammars, Linguistics and Philosophy 17: 221-248.
11. Johnson, M. (1995). Constraint-based natural language parsing, ESSLLI '95, Barcelona, Course notes.
12. Kayne, R. S. (1994). The Antisymmetry of Syntax, MIT Press, Cambridge, Mass. and London, England.
13. Kelb, P., Margaria, T., Mendler, M. and Gsottberger, C. (1997). MOSEL: A flexible toolset for monadic second-order logic, in E. Brinksma (ed.), TACAS '97.
14. Morawietz, F. (1997). Monadic second order logic, tree automata and constraint logic programming, Arbeitspapiere des SFB 340 86, SFB 340, Universit~t Tiibingen.
15. Morawietz, F. and Cornell, T. L. (1997). On the recognizability of relations over a tree definable in a monadic second order tree description language, Arbeitspapiere des SFB 340 85, SFB 340, Universit,it Tfibingen.
16. Niehren, J. and Podelski, A. (1992). Feature automata and recognizable sets of feature trees, in M.-C. Gandel and J.-P. Jouannaud (eds), Proceedings of the 4th International Joint Conference on Theory and Practice of Software Development, Springer, LNCS 668, pp. 356-375.
17. Rabin, M. O. (1969). Decidability of second-order theories and automata on infinite trees, Transactions of the AMS 141: 1-35.
18. Rizzi, L. (1990). Relativized Minimality, MIT Press.
19. Rogers, J. (1994). Studies in the Logic of Trees with Applications to Grammar Formalisms, PhD thesis, University of Delaware. CS-Technical Report No. 95-04.
20. Rogers, J. (1996). A model-theoretic framework for theories of syntax, Proc. of the 34th Annual Meeting of the ACL, Santa Cruz, USA.
21. Thatcher, J. W. and Wright, J. B. (1968). Generalized finite automata theory with an application to a decision problem of second-order logic, Mathematical Systems Theory 2(1): 57-81.
22. van Noord, G. (1995). The intersection of finite state automata and definite clause grammars, Proc. of the 33th Annual Meeting of the ACL, Boston.