SCOPUS 정보 검색 플랫폼

Electronic Notes in Theoretical Computer Science

Volumn 123, Issue , 2005, Pages 195-208

Deciding nondeterministic hierarchy of deterministic tree automata

(2) Niwiński, Damian a Walukiewicz, Igor b

a UNIVERSITY OF WARSAW (Poland)

b UNIVERSITÉ BORDEAUX 1 (France)

Author keywords

Decidability; Mostowski index; Parity tree automata

Indexed keywords

ALGORITHMS; COMPUTABILITY AND DECIDABILITY; COMPUTATIONAL COMPLEXITY; HIERARCHICAL SYSTEMS; MATHEMATICAL TRANSFORMATIONS; POLYNOMIALS; PROBLEM SOLVING; SEMANTICS; TREES (MATHEMATICS);

MOSTOWSKI INDEX; PARITY TREE AUTOMATA; RABIN AUTOMATON; TREE LANGUAGES;

AUTOMATA THEORY;

EID: 13944268374 PISSN: 15710661 EISSN: None Source Type: Journal
DOI: 10.1016/j.entcs.2004.05.015 Document Type: Conference Paper

Times cited : (31)

References (18)

1
- 0033295153
- The μ-calculus alternation-depth hierarchy is strict on binary trees
- A. Arnold The μ-calculus alternation-depth hierarchy is strict on binary trees RAIRO-Theoretical Informatics and Applications 33 1999 329 339
- (1999) RAIRO-Theoretical Informatics and Applications , vol.33 , pp. 329-339
- Arnold, A.¹

2
- 0003135879
- The modal mu-calculus alternation hierarchy is strict
- J.C. Bradfield The modal mu-calculus alternation hierarchy is strict Theoret. Comput. Sci. 195 1997 133 153
- (1997) Theoret. Comput. Sci. , vol.195 , pp. 133-153
- Bradfield, J.C.¹

3
- 0026368952
- Tree automata, mu-calculus and determinacy
- Emerson, E.A., and C. S. Jutla, "Tree automata, mu-calculus and determinacy", in: Proceedings 32th Annual IEEE Symp. on Foundations of Comput. Sci. (1991), 368-377
- (1991) Proceedings 32th Annual IEEE Symp. on Foundations of Comput. Sci. , pp. 368-377
- Emerson, E.A.¹ Jutla, C.S.²

4
- 84957813927
- On model-checking for fragments of the μ-calculus
- CAV'93
- E.A. Emerson, C.S. Jutla, and A.P. Sistla On model-checking for fragments of the μ-calculus CAV'93 Lect. Notes Comput. Sci. 697 1993 385 396
- (1993) Lect. Notes Comput. Sci. , vol.697 , pp. 385-396
- Emerson, E.A.¹ Jutla, C.S.² Sistla, A.P.³

5
- 0032203664
- Deciding the winner in parity games is UP ∩ co-UP
- M. Jurdziński Deciding the winner in parity games is UP ∩ co-UP Information Processing Letters 68 3 1998 119 124
- (1998) Information Processing Letters , vol.68 , Issue.3 , pp. 119-124
- Jurdziński, M.¹

6
- 84944078394
- Small progress measures for solving parity games
- STACS 2000
- M. Jurdziński Small progress measures for solving parity games STACS 2000 Lect. Notes Comput. Sci. 1770 2000 290 301
- (2000) Lect. Notes Comput. Sci. , vol.1770 , pp. 290-301
- Jurdziński, M.¹

7
- 84947755850
- A hierarchy theorem for the mu-calculus
- ICALP '96
- G. Lenzi A hierarchy theorem for the mu-calculus ICALP '96 Lect. Notes Comput. Sci. 1099 1996 87 109
- (1996) Lect. Notes Comput. Sci. , vol.1099 , pp. 87-109
- Lenzi, G.¹

8
- 84913355219
- Regular expressions for infinite trees and a standard form of automata
- Computation theory
- A.W. Mostowski Regular expressions for infinite trees and a standard form of automata Computation theory Lect. Notes Comput. Sci. 208 1985 169 176
- (1985) Lect. Notes Comput. Sci. , vol.208 , pp. 169-176
- Mostowski, A.W.¹

9
- 0026171775
- Hierarchies of weak automata and weak monadic formulas
- A.W. Mostowski Hierarchies of weak automata and weak monadic formulas Theoretical Comput. Sci. 83 1991 323 335
- (1991) Theoretical Comput. Sci. , vol.83 , pp. 323-335
- Mostowski, A.W.¹

10
- 85026897255
- On fixed point clones
- ICALP'86
- D. Niwiński On fixed point clones ICALP'86 Lect. Notes Comput. Sci. 226 1986 464 473
- (1986) Lect. Notes Comput. Sci. , vol.226 , pp. 464-473
- Niwiński, D.¹

11
- 0346678020
- Fixed points characterization of infinite behaviour of finite state systems
- D. Niwiński Fixed points characterization of infinite behaviour of finite state systems Theoretical Computer Science 189 1997 1 69
- (1997) Theoretical Computer Science , vol.189 , pp. 1-69
- Niwiński, D.¹

12
- 78649885483
- Relating hierarchies of word and tree automata
- STACS'98
- D. Niwiński, and I. Walukiewicz Relating hierarchies of word and tree automata STACS'98 Lect. Notes Comput. Sci. 1373 1998 320 331
- (1998) Lect. Notes Comput. Sci. , vol.1373 , pp. 320-331
- Niwiński, D.¹ Walukiewicz, I.²

13
- 0038040512
- A gap property of deterministic tree languages
- D. Niwiński, and I. Walukiewicz A gap property of deterministic tree languages Theoretical Comput. Sci. 303 2003 215 231
- (2003) Theoretical Comput. Sci. , vol.303 , pp. 215-231
- Niwiński, D.¹ Walukiewicz, I.²

14
- 84968501436
- Decidability of second-order theories and automata on infinite trees
- M.O. Rabin Decidability of second-order theories and automata on infinite trees Trans. Amer. Soc. 141 1969 1 35
- (1969) Trans. Amer. Soc. , vol.141 , pp. 1-35
- Rabin, M.O.¹

15
- 77956961851
- Weakly definable relations and special automata
- North-Holland Amsterdam
- M.O. Rabin Weakly definable relations and special automata Mathematical Logic and Foundation of Set Theory 1970 North-Holland Amsterdam 1 23
- (1970) Mathematical Logic and Foundation of Set Theory , pp. 1-23
- Rabin, M.O.¹

16
- 0001568609
- Languages, automata, and logic
- W. Thomas Languages, automata, and logic Handbook of Formal Languages volume 3 1997 389 455
- (1997) Handbook of Formal Languages , vol.3 , pp. 389-455
- Thomas, W.¹

17
- 84974622210
- On deciding if deterministic Rabin language is in Büchi class
- ICALP 2000
- T.F. Urbański On deciding if deterministic Rabin language is in Büchi class ICALP 2000 Lect. Notes Comput. Sci. 1853 2000 663 674
- (2000) Lect. Notes Comput. Sci. , vol.1853 , pp. 663-674
- Urbański, T.F.¹

18
- 0038442790
- Eine topologische Charakterisierung einiger Klassen regulärer Folgenmengen
- K. Wagner Eine topologische Charakterisierung einiger Klassen regulärer Folgenmengen J. Inf. Process. Cybern. EIK 13 1977 473 487
- (1977) J. Inf. Process. Cybern. EIK , vol.13 , pp. 473-487
- Wagner, K.¹

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.