The nesting-depth of disjunctive μ-calculus for tree languages and the limitedness problem

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

Volumn 5213 LNCS, Issue , 2008, Pages 416-430

  Colcombet, Thomas ^a   Löding, Christof ^b  

^a UNIVERSITÉ PARIS DIDEROT   (France)

^b RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTER PROGRAMMING LANGUAGES; COMPUTERS; CRYSTAL LATTICES; FUNCTIONS; LINGUISTICS; QUERY LANGUAGES; TECHNICAL PRESENTATIONS; TRANSLATION (LANGUAGES);

DISTANCE DESERT AUTOMATONS; FINITE TREES; FIX POINTS; GENERAL FRAMEWORKS; NATURAL NUMBERS; REGULAR EXPRESSIONS; REGULAR TREE LANGUAGES; TREE AUTOMATONS; TREE LANGUAGES;

COMPUTABILITY AND DECIDABILITY;

EID: 57849110943     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-87531-430     Document Type: Conference Paper

References (9)

1. Bojanczyk, M., Colcombet, T.: Bounds in ω-regularity. In: Proceedings of LICS 2006, pp. 285-296. IEEE Computer Society Press, Los Alamitos (2006)
2. Colcombet, T.: A combinatorial theorem for trees. In: Arge, L., Cachin, C., Jurdziński, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol. 4596, pp. 901-912. Springer, Heidelberg (2007)
3. Colcombet, T., Löding, C.: The non-deterministic Mostowski hierarchy and distance-parity automata. In: Proceedings of ICALP 2008. LNCS, vol. 5126, pp. 398-409. Springer, Heidelberg (2008)
4. Comon, H., Dauchet, M., Gilleron, R., Jacquemard. F., Löding, C., Lugiez, D., Tison, S., Tommasi, M.: Tree Automata Techniques and Applications (2007), http://tata.gforge.inria.fr
5. Doner, J.: Tree acceptors and some of their applications. Journal of Computer and System Sciences 4, 406-451 (1970)
6. Eggan, L.C.: Transition graphs and the star-height of regular events. Michigan Math. J. 10(4), 385-397 (1963)
7. Hashiguchi, K.: Algorithms for determining relative star height and star height. Inf. Comput. 78(2), 124-169 (1988)
8. Kirsten, D.: Distance desert automata and the star height problem. RAIRO 3(39), 455-509 (2005)
9. Thatcher. J.W., Wright, J.B.: Generalized finite automata theory with an application to a decision problem of second-order logic. Mathematical Systems Theory 2(1), 57-81 (1968)