An efficient automata approach to some problems on context-free grammars

Information Processing Letters

Volumn 74, Issue 5-6, 2000, Pages 221-227

  Bouajjani, Ahmed ^a   Esparza, Javier ^b   Finkel, Alain ^c   Maler, Oded ^d   Rossmanith, Peter ^b   Willems, Bernard ^e   Wolper, Pierre ^e  

^a UNIVERSITÉ PARIS DIDEROT   (France)

^b TECHNICAL UNIVERSITY OF MUNICH   (Germany)

^c CNRS   (France)

^d VERIMAG   (France)

^e UNIVERSITY OF LIÈGE   (Belgium)

Author keywords

Design of algorithms; Formal languages

Indexed keywords

ALGORITHMS; AUTOMATA THEORY; CONTEXT FREE LANGUAGES; THEOREM PROVING;

MONADIC STRING-REWRITING SYSTEMS;

CONTEXT FREE GRAMMARS;

EID: 0033703632     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(00)00055-7     Document Type: Article

References (12)

1. A.V. Aho, J.E. Hopcroft, J.D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1976.
2. R.F. Book, F. Otto, String-Rewriting Systems, Texts and Monographs in Computer Science, Springer, Berlin, 1993.
3. A. Bouajjani, O. Maler, Reachability analysis of pushdown automata, in: Proc. INFINITY'96 Workshop, Technical Report MIP-9614, Faculty of Mathematics and Computer Science, University of Passau, 1996.
4. A. Bouajjani, J. Esparza, O. Maler, Reachability analysis of pushdown automata: Application to model-checking, in: A. Mazurkiewicz, J. Winkowski (Eds.), Proc. CONCUR'97, Lecture Notes in Comput. Sci., Vol. 1243, Springer, Berlin, 1997, pp. 135-150.
5. J.R. Büchi, Regular canonical systems and finite automata, Arch. Math. Logik Grundl. 6 (1964) 91-111.
6. J.R. Büchi, Finite Automata, Their Algebras and Grammars, Springer, Berlin, 1988.
7. D. Caucal, On the regular structure of prefix rewriting, Theoret. Comput. Sci. 106 (1) (1992) 61-86.
8. W.F. Dowling, J.H. Gallier, Linear-time algorithms for testing the satisfiability of prepositional Horn formulae, J. Logic Programming 3 (1984) 267-284.
9. J. Esparza, P. Rossmanith, An automata approach to some problems on context-free grammars, in: C. Freksa, M. Jantzen, R. Valk (Eds.), Foundations of Computer Science: Potential, Theory, Cognition, Lecture Notes in Comput. Sci., Vol. 1337, 1997, pp. 143-152.
10. A. Finkel, B. Willems, P. Wolper, A direct symbolic approach to model-checking pushdown systems, in: Proc. INFINITY'97 Workshop, Electronic Notes in Theoretical Computer Science, Vol. 9, 1997.
11. J.E. Hopcroft, J.D. Ullman, Introduction to Automata Theory, Languages and Computation, Addison-Wesley, Reading, MA, 1979.
12. 3, Inform, and Control 10 (1967) 189-208.