Regularity problems for visibly pushdown languages

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

Volumn 3884 LNCS, Issue , 2006, Pages 420-431

  Bárány, Vince ^a   Löding, Christof ^a   Serre, Olivier ^b  

^a RWTH AACHEN UNIVERSITY   (Germany)

^b UNIVERSITÉ PARIS DIDEROT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COMPUTER PROGRAMMING LANGUAGES; PROBLEM SOLVING;

FINITE AUTOMATON; REGULARITY PROBLEMS; VISIBLY PUSHDOWN LANGUAGE;

ARTIFICIAL INTELLIGENCE;

EID: 33745632591     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11672142_34     Document Type: Conference Paper

References (16)

1. R. Alur, K. Etessami, and P. Madhusudan. A temporal logic of nested calls and returns. In TACAS'04, LNCS 2988, 467-481. Springer, 2004.
2. R. Alur and P. Madhusudan. Visibly pushdown languages. In Proceedings of STOC'04, pages 202-211. ACM, 2004.
3. R. Alur, P. Madhusudan, V. Kumar, and M. Viswanatha. Congruences for visibly pushdown languages. In ICALP'05, LNCS 3580, pages 1102-1114, 2005.
4. M. Andraşiu, G. Pǎun, J. Dassow, and A. Salomaa, Language-theoretic problems arising from Richelieu cryptosystems. Theor. Comp. Sci., 116(2):339-357, 1993.
5. Jean Berstel and Luc Boasson. Formal properties of XML grammars and languages. Acta Informatica, 38(9):649-671, 2002.
6. A. Bouajjani, J. Esparza, and O. Maler, Reachability analysis of pushdown automata: Application to model-checking. In CONCUR'97, LNCS 1243, pages 135-150. Springer, 1997.
7. J. R. Büchi. Regular canonical systems. Archiv für Mathematische Grundlagenforschung, 6:91-111, 1964.
8. J. Esparza, D. Hansel, P. Rossmanith, and S. Schwoon. Efficient algorithms for model checking pushdown systems. In CAV'00, LNCS 1855, pp. 232-247. Springer.
9. C. Frougny and J. Sakarovitch. Synchronized rational relations of finite and infinite words. Theoretical Computer Science, 108(1):45-82, 1993.
10. J. E. Hopcroft and J. D. Ullman. Formal Languages and their Relation to Automata. Addison-Wesley, 1969.
11. C. Löding, P. Madhusudan, and O. Serre. Visibly pushdown games. In FST&TCS'04, LNCS 3328, pages 408-420. Springer, 2004.
12. C. Pitcher. Visibly pushdown expression effects for XML stream processing. In Programming Language Technologies for XML, PLAN-X'05, pages 5-19, 2005.
13. G. Pǎun and A. Salomaa. Thin and slender languages. Discrete Applied Mathematics, 61(3):257-270, 1995.
14. L. Segoufin and V. Vianu. Validating streaming XML documents. In Proceedings of PODS'02, pages 53-64. ACM, 2002.
15. R. E. Stearns. A regularity test for pushdown machines. Information and Control, 11(3):323-340, 1967.
16. L. G. Valiant. Regularity and related problems for deterministic pushdown automata. Journal of the ACM, 22(1):1-10, 1975.