Unsafe grammars and panic automata

Lecture Notes in Computer Science

Volumn 3580, Issue , 2005, Pages 1450-1461

  Knapik, Teodor ^a   Niwiński, Damian ^b   Urzyczyn, Paweł ^b   Walukiewicz, Igor ^c  

^a UNIVERSITÉ DE LA NOUVELLE CALÉDONIE   (New Caledonia)

^b UNIVERSITY OF WARSAW   (Poland)

^c UNIVERSITÉ BORDEAUX 1   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY; COMPUTER PROGRAMMING LANGUAGES; MATHEMATICAL MODELS; PROBLEM SOLVING; TREES (MATHEMATICS);

HYPERALGEBRAIC TREE; INFINITE TREE; SECOND-ORDER GRAMMARS; Μ-CALCULUS;

AUTOMATA THEORY;

EID: 26644460416     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11523468_117     Document Type: Conference Paper

References (21)

1. Aehlig, K., de Miranda, J.G., and Ong, L., Safety is not a restriction at level 2 for string languages. In: Proc. FOSSACS '05, Springer LNCS 3441 (2005), 490-504.
2. Aehlig, K., de Miranda J.G., and Ong, L., The monadic second order theory of trees given by arbitrary level-two recursion schemes is decidable. In: Proc. TLCA '05, Springer LNCS 3461 (2005), 39-54.
3. Cachat, T., Higher Order Pushdown Automata, the Caucal Hierarchy of Graphs and Parity Games. In: Proc. ICALP 2003, Springer LNCS 2719 (2003), 556-569.
4. Cachat, T., Walukiewicz, I., The complexity of games on higher order pushdown automata, manuscript, 2004.
5. Caucal, D., On infinite terms having a decidable monadic second-order theory. In: Proc. MFCS 2002, Springer LNCS 2420 (2002), 65-176.
6. Courcelle, B., The monadic second-order theory of graphs IX: Machines and their behaviours. Theoretical Comput. Sci., 151:125-162, 1995.
7. Courcelle, B., Knapik, T., The evaluation of if first-order substitution is monadic second-order compatible Theoretical Comput. Sci., 281(1-2):177-206, 2002.
8. Damm, W., The IO- and OI-hierarchies. Theoretical Comput. Sci., 20(2):95-208, 1982.
9. Emerson, E. A., Jutla, C. S., Tree automata, mu-calculus and determinacy. In: Proceedings 32th Annual IEEE Symp. on Foundations of Comput. Sci., IEEE Computer Society Press, 1991, pp. 368-377.
10. Engelfriet, J., Iterated push-down automata and complexity classes. In: Proc. 15th STOC, 1983, pp. 365-373.
11. Engelfriet, J., Schmidt, E.M., IO and OI, J. Comput. System Sci. 15, 3, 1977, pp. 328-353,
12. and Engelfriet, J., Schmidt, E.M., IO and OI, J. Comput. System Sci. 16, 1, 1978, pp. 67-99.
13. Grädel, E., Thomas, W., and Wilke, T., Editors, Automata, Logics, and Infinite Games. A Guide to Current Research, LNCS 1500, Springer-Verlag, 2002.
14. Knapik, T., Niwiński, D., and Urzyczyn, P., Deciding monadic theories of hyperalgebraic trees. In: Typed Lambda Calculi and Applications, 5th International Conference, Springer LNCS 2044 (2001), 253-267.
15. Knapik, T., Niwiński, D., Urzyczyn, P., Higher-order pushdown trees are easy. In: Proc. FoSSaCS'02, Springer LNCS 2303 (2002), 205-222.
16. Knapik, T., Niwiński, D., Urzyczyn, P., Walukiewicz, I., Unsafe grammars and panic automata, draft, http://www.mimuw.edu.pl/~ niwinski/prace.html.
17. Maslov, A.N., The hierarchy of indexed languages of an arbitrary level, Soviet Math. Dokl., 15, pp. 1170-1174, 1974.
18. A. W. Mostowski. Games with forbidden positions. Technical Report 78, Instytut Matematyki, University of Gdansk, 1991.
19. Niwiński, D., Fixed points characterization of infinite behaviour of finite state systems. Theoret. Comput. Sci., 189:1-69, 1997.
20. Thomas, W., Languages, automata, and logic. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, volume 3, Springer-Verlag, 1997, pp. 389-455.
21. Walukiewicz, I., Pushdown processes: Games and model checking. Information and Computation, 164(2):234-263, 2001.