SCOPUS 정보 검색 플랫폼

Volumn 262, Issue 1-2, 2001, Pages 669-697

Topological properties of omega context-free languages

a INSTITUT DE MATHÉMATIQUES DE JUSSIEU (France)

Author keywords

Arithmetical properties; Borel class; Decide the Borel class; Gale Stewart game; Omega context free languages; Omega powers; Topological properties; Wadge class

Indexed keywords

GAME THEORY; SET THEORY; TOPOLOGY;

GALE-STEWART GAME; OMEGA CONTEXT FREE LANGUAGES;

CONTEXT FREE LANGUAGES;

EID: 0034912597 PISSN: 03043975 EISSN: None Source Type: Journal
DOI: 10.1016/S0304-3975(00)00405-9 Document Type: Article

Times cited : (48)

References (49)

1
- 0003237210
- Context free languages and pushdown automata
- G. Rozenberg and A. Salomaa, Springer, Berlin
- (1996) Handbook of Formal Languages , vol.1
- Autebert, J.-M.¹ Berstel, J.² Boasson, L.³

2
- 0026852039
- The Hausdorff-Kuratowski hierarchy of ω-regular languages and a hierarchy of Muller automata
- (1992) Theoret. Comput. Sci. , vol.96 , pp. 345-360
- Barua, R.¹

3
- 0003283636
- Transductions and Context Free Languages
- (1979) Teubner Studienbücher Informatik
- Berstel, J.¹

4
- 0000498126
- Adherences of Languages
- (1980) J. Comput. System Sci. , vol.20 , Issue.3 , pp. 285-309
- Boasson, L.¹ Nivat, M.²

5
- 70350098746
- Weak second order arithmetic and finite automata
- (1960) Z. Math. Logik Grundlag. Math. , vol.6 , pp. 66-92
- Büchi, J.R.¹

6
- 0002921602
- On a Decision Method in Restricted Second Order Arithmetic, Logic Methodology and Philosophy of Science
- Stanford University Press, Stanford, CA
- (1962) Proc. 1960 Internat. Congr. , pp. 1-11
- Büchi, J.R.¹

7
- 84968476508
- Solving sequential conditions by finite state strategies
- (1969) Trans. Amer. Math. Soc. , vol.138 , pp. 295-311
- Büchi, J.R.¹ Landweber, L.H.²

8
- 0000985390
- The Monadic Second Order Theory of All Countable ordinals, Decidable Theories 2
- Springer, Berlin
- (1973) Springer Lecture Notes in Mathematics , vol.328
- Büchi, J.R.¹ Siefkes, D.²

9
- 0000136802
- Theory of ω-languages, Parts 1 and 2
- (1977) J. Comput. System Sci. , vol.15 , Issue.2 , pp. 169-184
- Cohen, R.S.¹ Gold, A.Y.²

10
- 0000855431
- ω-computations on deterministic pushdown machines
- (1978) J. Comput. System Sci. , Issue.3 , pp. 257-300
- Cohen, R.S.¹ Gold, A.Y.²

11
- 0642367509
- Chains and superchains for ω-rational sets, automata and semigroups
- (1997) Internat. J. Algebra Comput. , vol.7 , Issue.6 , pp. 673-695
- Carton, O.¹ Perrin, D.²

12
- 0000754339
- The Wagner hierarchy of ω-rational sets
- (1999) Internat. J. Algebra Comput. , vol.9 , pp. 597-620
- Carton, O.¹ Perrin, D.²

13
- 0003992746
- Ph.D. Thesis, Université Paris 7
- (1995) La Forme Normale des Boréliens de Rang Fini
- Duparc, J.¹

14
- 0003897350
- t.320, Série 1, C.R.A.S., Paris
- (1995) The Normal form of Borel sets, Part 1: Borel sets of finite rank , pp. 651-656
- Duparc, J.¹

15
- 0035630647
- Wadge Hierarchy and Veblen hierarchy: Part 1: Borel sets of finite rank
- (2001) J. Symbolic Logic
- Duparc, J.¹

16
- 0004459560
- A hierarchy of context free Omega languages
- submitted for publication
- Theoret. Comput. Sci.
- Duparc, J.¹

17
- 0034918301
- Computer Science and the Fine Structure of Borel Sets
- in preparation
- Theoret. Comput. Sci.
- Duparc, J.¹ Finkel, O.² Ressayre, J.-P.³

18
- 0004277611
- Academic Press, New York
- (1974) Automata, Languages and Machines , vol.A
- Eilenberg, S.¹

19
- 0027561226
- X-automata on ω-words
- (1993) Theoret. Comput. Sci. , vol.110 , Issue.1 , pp. 1-51
- Engelfriet, J.¹ Hoogeboom, H.J.²

20
- 0035965487
- Wadge hierarchy of omega context free languages
- in preparation
- Theoret. Comput. Sci.
- Finkel, O.¹

21
- 85009165670
- Borel hierarchy and omega context free languages
- submitted for publication
- Theoret. Comput. Sci.
- Finkel, O.¹

22
- 0037537018
- in preparation
- Wadge hierarchy and deterministic omega context free languages
- Finkel, O.¹

23
- 0001255444
- Infinite games with perfect information
- (1953) Ann. Math. Studies , vol.28 , pp. 245-266
- Gale, D.¹ Stewart, F.M.²

24
- 0003508350
- McGraw-Hill, New York
- (1966) The Mathematical Theory of Context Free Languages
- Ginsburg, S.¹

25
- 0003733548
- Addison-Wesley, Reading, MA
- (1969) Formal Languages and their Relation to Automata
- Hopcroft, J.E.¹ Ullman, J.D.²

26
- 0022052397
- A classification of ω-regular languages
- (1985) Theoret. Comput. Sci. , vol.36 , pp. 217-229
- Kaminsky, M.¹

27
- 0003391813
- Academic Press, New York
- (1966) Topology
- Kuratowski, K.¹

28
- 0001578717
- Decision problems for ω-automata
- (1969) Math. Systems Theory , vol.3 , Issue.4 , pp. 376-384
- Landweber, L.H.¹

29
- 85011661085
- Logical specifications of infinite computations
- J.W. de Bakker, et al., (Eds.), A Decade of Concurrency, Springer, Berlin
- (1994) Springer Lecture Notes in Computer Science , vol.803 , pp. 583-621
- Lescow, H.¹ Thomas, W.²

30
- 0001182927
- On ω-sets associated with context-free languages
- (1976) Inform. and Control , vol.31 , Issue.3 , pp. 272-293
- Linna, M.¹

31
- 0002983050
- A decidability result for deterministic ω-context-free languages
- (1977) Theoret. Comput. Sci. , vol.4 , pp. 83-98
- Linna, M.¹

32
- 0000399713
- Testing and Generating infinite sequences by a finite automaton
- (1966) Inform. and Control , vol.9 , pp. 521-530
- MacNaughton, R.¹

33
- 0004270686
- North-Holland, Amsterdam
- (1980) Descriptive Set Theory
- Moschovakis, Y.N.¹

34
- 0017634372
- Mots infinis engendrés par une grammaire algébrique
- (1977) RAIRO Infor. Théor. , vol.11 , pp. 311-327
- Nivat, M.¹

35
- 0018053508
- Sur les ensembles de mots infinis engendrés par une grammaire algébrique
- (1978) RAIRO Infor. Théor. , vol.12 , pp. 259-278
- Nivat, M.¹

36
- 0004495868
- Problem on ω-powers
- University of Kiel
- Proceedings of the 1990 Workshop, Logics and Recognizable Sets
- Niwinski, D.¹

37
- 0004495577
- Book in preparation
- Perrin, D.¹ Pin, J.-E.²

38
- 0003018677
- Fine hierarchy of regular ω-languages
- (1998) Theoret. Comput. Sci. , vol.191 , pp. 37-59
- Selivanov, V.¹

39
- 0003875901
- Ph.D. Thesis, Université Paris 7, March
- (1992) Automates et théorie descriptive
- Simonnet, P.¹

40
- 0000189487
- Hierarchies of Recursive ω-Languages
- (1986) J. Inform. Process. Cybernet. EIK , vol.22 , Issue.5-6 , pp. 219-241
- Staiger, L.¹

41
- 0000103668
- ω-languages
- G. Rozenberg, A. Salomaa (Eds.), Springer, Berlin
- (1997) Handbook of Formal Languages , vol.3
- Staiger, L.¹

42
- 21744438399
- On ω-power languages
- G. Paun, A. Salomaa (Ed.), New Trends in Formal Languages, Control, Cooperation, and Combinatorics, Springer, Berlin
- (1997) Lecture Notes in Computer Science , vol.1218 , pp. 377-393
- Staiger, L.¹

43
- 0001497021
- Automatentheoretische und Automatenfreie Charakterisierungen Topologischer Klassen Regulärer Folgenmengen
- (1974) Elektron. Informationsverarb. Kybernetik EIK , vol.10 , Issue.7 , pp. 379-392
- Staiger, L.¹ Wagner, K.²

44
- 0001282303
- Automata on Infinite Objects
- J. Van Leeuwen (Ed.), Elsevier, Amsterdam
- (1990) Handbook of Theoretical Computer Science , vol.B , pp. 133-191
- Thomas, W.¹

45
- 38149135474
- On the synthesis of strategies in infinite games, STACS'95
- Springer, Berlin
- (1995) Lecture Notes in Computer Science , vol.900 , pp. 1-13
- Thomas, W.¹

46
- 0004479308
- Ph.D. Thesis, Berkeley
- (1984)
- Wadge, W.W.¹

47
- 0018542186
- On omega regular sets
- (1979) Inform. and Control , vol.43 , pp. 123-177
- Wagner, K.¹

48
- 84957642329
- Pushdown processes: Games and model checking
- published in CAV'96, LNCS 1102, full version, to appear
- Inform. Comput. , pp. 62-75
- Walukiewicz, I.¹

49
- 0343242844
- Computing the Wadge degree, the Lifschitz degree and the Rabin index of a regular language of infinite words in polynomial time
- P.D. Mosses, M. Nielsen, M.I. Schwartzbach (Eds.), TAPSOFT' 95: Theory and Practice of Software Development, Springer, Berlin
- (1995) Lecture Notes in Computer Science , vol.915 , pp. 288-302
- Wilke, Th.¹ Yoo, H.²

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