DBLP: Olivier Finkel

	2013
j37		Olivier Finkel, Stevo Todorcevic: Automatic Ordinals. IJUC 9(1-2): 61-70 (2013)
c8		Jacques Duparc, Olivier Finkel, Jean-Pierre Ressayre: The Wadge Hierarchy of Petri Nets ω-Languages. LFCS 2013: 179-193
	2012
j36		Olivier Finkel: Three Applications to Rational Relations of the High Undecidability of the Infinite Post Correspondence Problem in a Regular ω-Language. Int. J. Found. Comput. Sci. 23(7): 1481-1498 (2012)
j35		Olivier Finkel, Stevo Todorcevic: A hierarchy of tree-automatic structures. J. Symb. Log. 77(1): 350-368 (2012)
c7		Olivier Finkel: The Determinacy of Context-Free Games. STACS 2012: 555-566
i38		Olivier Finkel, Stevo Todorcevic: Automatic Ordinals. CoRR abs/1205.1775 (2012)
i37		Olivier Finkel: Ambiguity of omega-Languages of Turing Machines. CoRR abs/1209.5669 (2012)
	2011
j34		Olivier Finkel: Some problems in automata theory which depend on the models of set theory. RAIRO - Theor. Inf. and Applic. 45(4): 383-397 (2011)
j33		Olivier Finkel: On Decidability Properties of One-Dimensional Cellular Automata. J. Cellular Automata 6(2-3): 181-193 (2011)
i36		Olivier Finkel: Borel Hierarchy and Omega Context Free Languages. CoRR abs/1101.3443 (2011)
i35		Olivier Finkel: Three Applications to Rational . CoRR abs/1107.5886 (2011)
i34		Olivier Finkel: Decision Problems for Recognizable Languages of Infinite Pictures. CoRR abs/1107.5896 (2011)
i33		Olivier Finkel: Some Problems in Automata Theory Which Depend on the Models of Set Theory. CoRR abs/1108.2864 (2011)
i32		Olivier Finkel, Stevo Todorcevic: A Hierarchy of Tree-Automatic Structures. CoRR abs/1111.1504 (2011)
i31		Olivier Finkel: The Determinacy of Context-Free Games. CoRR abs/1112.1186 (2011)
	2010
j32		Olivier Finkel: On some sets of dictionaries whose omega -powers have a given. Math. Log. Q. 56(5): 452-460 (2010)
i30		Olivier Finkel: On Infinitary Rational Relations and Borel Sets. CoRR abs/1005.5608 (2010)
i29		Olivier Finkel: On Omega Context Free Languages which are Borel Sets of Infinite Rank. CoRR abs/1005.5633 (2010)
i28		Olivier Finkel: An Effective Extension of the Wagner Hierarchy to Blind Counter Automata. CoRR abs/1005.5635 (2010)
i27		Olivier Finkel, Stevo Todorcevic: The Isomorphism Relation Between Tree-Automatic Structures. CoRR abs/1007.0822 (2010)
	2009
j31		Olivier Finkel, Dominique Lecomte: Classical and effective descriptive complexities of omega-powers. Ann. Pure Appl. Logic 160(2): 163-191 (2009)
j30		Olivier Finkel: The Complexity of Infinite Computations In Models of Set Theory. Logical Methods in Computer Science 5(4) (2009)
j29		Olivier Finkel: Highly Undecidable Problems about Recognizability by Tiling Systems. Fundam. Inform. 91(2): 305-323 (2009)
j28		Olivier Finkel, Pierre Simonnet: On Recognizable Tree Languages Beyond the Borel Hierarchy. Fundam. Inform. 95(2-3): 287-303 (2009)
j27		Olivier Finkel, Dominique Lecomte: Decision problems for Turing machines. Inf. Process. Lett. 109(23-24): 1223-1226 (2009)
j26		Olivier Finkel: Highly Undecidable Problems For Infinite Computations. ITA 43(2): 339-364 (2009)
i26		Olivier Finkel: Highly Undecidable Problems For Infinite Computations. CoRR abs/0901.0373 (2009)
i25		Olivier Finkel: On Recognizable Languages of Infinite Pictures. CoRR abs/0901.3828 (2009)
i24		Olivier Finkel: On Decidability Properties of One-Dimensional Cellular Automata. CoRR abs/0903.4615 (2009)
i23		Olivier Finkel, Pierre Simonnet: On Recognizable Tree Languages Beyond the Borel Hierarchy. CoRR abs/0909.0393 (2009)
i22		Olivier Finkel, Dominique Lecomte: Decision Problems For Turing Machines. CoRR abs/0909.0736 (2009)
i21		Olivier Finkel: On Some Sets of Dictionaries Whose omega-Powers Have a Given Complexity. CoRR abs/0911.3307 (2009)
	2008
j25		Olivier Finkel: Topological complexity of locally finite omega -languages. Arch. Math. Log. 47(6): 625-651 (2008)
j24		Olivier Carton, Olivier Finkel, Pierre Simonnet: On the continuity set of an Omega rational function. ITA 42(1): 183-196 (2008)
j23		Olivier Finkel: Wadge Degrees of Infinitary Rational Relations. Mathematics in Computer Science 2(1): 85-102 (2008)
i20		Olivier Finkel, Pierre Simonnet: Topology and Ambiguity in Omega Context Free Languages. CoRR abs/0801.0533 (2008)
i19		Olivier Finkel: On the Length of the Wadge Hierarchy of Omega Context Free Languages. CoRR abs/0801.0534 (2008)
i18		Olivier Finkel: An omega-Power of a Finitary Language Which is a Borel Set of Infinite Rank. CoRR abs/0801.0535 (2008)
i17		Olivier Finkel, Jean-Pierre Ressayre, Pierre Simonnet: On Infinite Real Trace Rational Languages of Maximum Topological Complexity. CoRR abs/0801.0537 (2008)
i16		Jacques Duparc, Olivier Finkel: An omega-power of a context-free language which is Borel above Delta^0_omega. CoRR abs/0801.1783 (2008)
i15		Olivier Carton, Olivier Finkel, Pierre Simonnet: On the Continuity Set of an omega Rational Function. CoRR abs/0801.3912 (2008)
i14		Olivier Finkel: On Winning Conditions of High Borel Complexity in Pushdown Games. CoRR abs/0803.1830 (2008)
i13		Olivier Finkel: On the Topological Complexity of Infinitary Rational Relations. CoRR abs/0803.1841 (2008)
i12		Olivier Finkel: Closure Properties of Locally Finite Omega Languages. CoRR abs/0803.1842 (2008)
i11		Olivier Finkel: Wadge Degrees of Infinitary Rational Relations. CoRR abs/0804.3266 (2008)
i10		Olivier Finkel: Topological Complexity of Context-Free omega-Languages: A Survey. CoRR abs/0806.1413 (2008)
i9		Olivier Finkel, Dominique Lecomte: Topological Complexity of omega-Powers : Extended Abstract. CoRR abs/0809.1812 (2008)
i8		Olivier Finkel: Highly Undecidable Problems about Recognizability by Tiling Systems. CoRR abs/0811.3704 (2008)
	2007
j22		Olivier Finkel: An Example of Pi⁰₃-complete Infinitary Rational Relation. The Computer Science Journal of Moldova 15(1): 3-21 (2007)
j21		Olivier Finkel, Stevo Todorcevic: Local sentences and Mahlo cardinals. Math. Log. Q. 53(6): 558-563 (2007)
c6		Olivier Finkel, Dominique Lecomte: There Exist Some omega -Powers of Any Borel Rank. CSL 2007: 115-129
i7		Dominique Lecomte, Olivier Finkel: There Exist some Omega-Powers of Any Borel Rank. CoRR abs/0706.3523 (2007)
i6		Olivier Finkel, Dominique Lecomte: Classical and Effective Descriptive Complexities of omega-Powers. CoRR abs/0708.4176 (2007)
i5		Olivier Finkel: On Decidability Properties of Local Sentences. CoRR abs/0712.0164 (2007)
i4		Olivier Finkel: On the Accepting Power of 2-Tape Büchi Automata. CoRR abs/0712.0165 (2007)
i3		Olivier Finkel: Borel Ranks and Wadge Degrees of Context Free Omega Languages. CoRR abs/0712.1359 (2007)
i2		Olivier Finkel: Undecidable Problems About Timed Automata. CoRR abs/0712.1363 (2007)
i1		Olivier Finkel: An Example of Pi^0_3-complete Infinitary Rational Relation. CoRR abs/math/0702334 (2007)
	2006
j20		Olivier Finkel: On the Shuffle of Regular Timed Languages. Bulletin of the EATCS 88: 182-184 (2006)
j19		Olivier Finkel: Borel ranks and Wadge degrees of context free omega-languages. Mathematical Structures in Computer Science 16(5): 813-840 (2006)
j18		Olivier Finkel: On decidability properties of local sentences. Theor. Comput. Sci. 364(2): 196-211 (2006)
c5		Olivier Finkel: Undecidable Problems About Timed Automata. FORMATS 2006: 187-199
c4		Olivier Finkel: On the Accepting Power of 2-Tape Büchi Automata. STACS 2006: 301-312
	2005
j17		Olivier Finkel: On Decision Problems for Timed Automata. Bulletin of the EATCS 87: 185-190 (2005)
j16		Olivier Finkel: On Decidability Properties of Local Sentences. Electr. Notes Theor. Comput. Sci. 123: 75-92 (2005)
j15		Olivier Finkel: On Winning Conditions of High Borel Complexity in Pushdown Games. Fundam. Inform. 66(3): 277-298 (2005)
j14		Olivier Finkel: On the Length of the Wadge Hierarchy of Omega-Context Free Languages. Journal of Automata, Languages and Combinatorics 10(4): 439-464 (2005)
c3		Olivier Finkel: Borel Ranks and Wadge Degrees of Context Free omega-Languages. CiE 2005: 129-138
	2004
j13		Olivier Finkel: An omega-Power of a Finitary Language Which is a Borel Set of Infinite Rank. Fundam. Inform. 62(3-4): 333-342 (2004)
j12		Olivier Finkel: On Recognizable Languages Of Infinite Pictures. Int. J. Found. Comput. Sci. 15(6): 823-840 (2004)
j11		Olivier Finkel: Closure properties of locally finite omega-languages. Theor. Comput. Sci. 322(1): 69-84 (2004)
	2003
j10		Olivier Finkel: On the Topological Complexity of Infinitary Rational Relations. ITA 37(2): 105-113 (2003)
j9		Olivier Finkel: Undecidability of Topological and Arithmetical Properties of Infinitary Rational Relations. ITA 37(2): 115-126 (2003)
j8		Olivier Finkel: On omega context free languages which are Borel sets of infinite rank. Theor. Comput. Sci. 1-3(299): 327-346 (2003)
j7		Olivier Finkel: Ambiguity in omega context free languages. Theor. Comput. Sci. 1-3(301): 217-270 (2003)
j6		Olivier Finkel: Borel hierarchy and omega context free languages. Theor. Comput. Sci. 290(3): 1385-1405 (2003)
c2		Olivier Finkel: On Infinitary Rational Relations and Borel Sets. DMTCS 2003: 155-167
	2001
j5		Olivier Finkel: Locally finite languages. Theor. Comput. Sci. 255(1-2): 223-261 (2001)
j4		Jacques Duparc, Olivier Finkel, Jean-Pierre Ressayre: Computer science and the fine structure of Borel sets. Theor. Comput. Sci. 257(1-2): 85-105 (2001)
j3		Olivier Finkel: Topological properties of omega context-free languages. Theor. Comput. Sci. 262(1): 669-697 (2001)
j2		Olivier Finkel: Wadge hierarchy of omega context-free languages. Theor. Comput. Sci. 269(1-2): 283-315 (2001)
c1		Olivier Finkel: An Effective Extension of the Wagner Hierarchy to Blind Counter Automata. CSL 2001: 369-383
	1996
j1		Olivier Finkel, Jean-Pierre Ressayre: Stretchings. J. Symb. Log. 61(2): 563-585 (1996)

2013

j37

Olivier Finkel, Stevo Todorcevic: Automatic Ordinals. IJUC 9(1-2): 61-70 (2013)

Jacques Duparc, Olivier Finkel, Jean-Pierre Ressayre: The Wadge Hierarchy of Petri Nets ω-Languages. LFCS 2013: 179-193

2012

j36

Olivier Finkel: Three Applications to Rational Relations of the High Undecidability of the Infinite Post Correspondence Problem in a Regular ω-Language. Int. J. Found. Comput. Sci. 23(7): 1481-1498 (2012)

j35

Olivier Finkel, Stevo Todorcevic: A hierarchy of tree-automatic structures. J. Symb. Log. 77(1): 350-368 (2012)

Olivier Finkel: The Determinacy of Context-Free Games. STACS 2012: 555-566

i38

Olivier Finkel, Stevo Todorcevic: Automatic Ordinals. CoRR abs/1205.1775 (2012)

i37

Olivier Finkel: Ambiguity of omega-Languages of Turing Machines. CoRR abs/1209.5669 (2012)

2011

j34

Olivier Finkel: Some problems in automata theory which depend on the models of set theory. RAIRO - Theor. Inf. and Applic. 45(4): 383-397 (2011)

j33

Olivier Finkel: On Decidability Properties of One-Dimensional Cellular Automata. J. Cellular Automata 6(2-3): 181-193 (2011)

i36

Olivier Finkel: Borel Hierarchy and Omega Context Free Languages. CoRR abs/1101.3443 (2011)

i35

Olivier Finkel: Three Applications to Rational . CoRR abs/1107.5886 (2011)

i34

Olivier Finkel: Decision Problems for Recognizable Languages of Infinite Pictures. CoRR abs/1107.5896 (2011)

i33

Olivier Finkel: Some Problems in Automata Theory Which Depend on the Models of Set Theory. CoRR abs/1108.2864 (2011)

i32

Olivier Finkel, Stevo Todorcevic: A Hierarchy of Tree-Automatic Structures. CoRR abs/1111.1504 (2011)

i31

Olivier Finkel: The Determinacy of Context-Free Games. CoRR abs/1112.1186 (2011)

2010

j32

Olivier Finkel: On some sets of dictionaries whose omega -powers have a given. Math. Log. Q. 56(5): 452-460 (2010)

i30

Olivier Finkel: On Infinitary Rational Relations and Borel Sets. CoRR abs/1005.5608 (2010)

i29

Olivier Finkel: On Omega Context Free Languages which are Borel Sets of Infinite Rank. CoRR abs/1005.5633 (2010)

i28

Olivier Finkel: An Effective Extension of the Wagner Hierarchy to Blind Counter Automata. CoRR abs/1005.5635 (2010)

i27

Olivier Finkel, Stevo Todorcevic: The Isomorphism Relation Between Tree-Automatic Structures. CoRR abs/1007.0822 (2010)

2009

j31

Olivier Finkel, Dominique Lecomte: Classical and effective descriptive complexities of omega-powers. Ann. Pure Appl. Logic 160(2): 163-191 (2009)

j30

Olivier Finkel: The Complexity of Infinite Computations In Models of Set Theory. Logical Methods in Computer Science 5(4) (2009)

j29

Olivier Finkel: Highly Undecidable Problems about Recognizability by Tiling Systems. Fundam. Inform. 91(2): 305-323 (2009)

j28

Olivier Finkel, Pierre Simonnet: On Recognizable Tree Languages Beyond the Borel Hierarchy. Fundam. Inform. 95(2-3): 287-303 (2009)

j27

Olivier Finkel, Dominique Lecomte: Decision problems for Turing machines. Inf. Process. Lett. 109(23-24): 1223-1226 (2009)

j26

Olivier Finkel: Highly Undecidable Problems For Infinite Computations. ITA 43(2): 339-364 (2009)

i26

Olivier Finkel: Highly Undecidable Problems For Infinite Computations. CoRR abs/0901.0373 (2009)

i25

Olivier Finkel: On Recognizable Languages of Infinite Pictures. CoRR abs/0901.3828 (2009)

i24

Olivier Finkel: On Decidability Properties of One-Dimensional Cellular Automata. CoRR abs/0903.4615 (2009)

i23

Olivier Finkel, Pierre Simonnet: On Recognizable Tree Languages Beyond the Borel Hierarchy. CoRR abs/0909.0393 (2009)

i22

Olivier Finkel, Dominique Lecomte: Decision Problems For Turing Machines. CoRR abs/0909.0736 (2009)

i21

Olivier Finkel: On Some Sets of Dictionaries Whose omega-Powers Have a Given Complexity. CoRR abs/0911.3307 (2009)

2008

j25

Olivier Finkel: Topological complexity of locally finite omega -languages. Arch. Math. Log. 47(6): 625-651 (2008)

j24

Olivier Carton, Olivier Finkel, Pierre Simonnet: On the continuity set of an Omega rational function. ITA 42(1): 183-196 (2008)

j23

Olivier Finkel: Wadge Degrees of Infinitary Rational Relations. Mathematics in Computer Science 2(1): 85-102 (2008)

i20

Olivier Finkel, Pierre Simonnet: Topology and Ambiguity in Omega Context Free Languages. CoRR abs/0801.0533 (2008)

i19

Olivier Finkel: On the Length of the Wadge Hierarchy of Omega Context Free Languages. CoRR abs/0801.0534 (2008)

i18

Olivier Finkel: An omega-Power of a Finitary Language Which is a Borel Set of Infinite Rank. CoRR abs/0801.0535 (2008)

i17

Olivier Finkel, Jean-Pierre Ressayre, Pierre Simonnet: On Infinite Real Trace Rational Languages of Maximum Topological Complexity. CoRR abs/0801.0537 (2008)

i16

Jacques Duparc, Olivier Finkel: An omega-power of a context-free language which is Borel above Delta^0_omega. CoRR abs/0801.1783 (2008)

i15

Olivier Carton, Olivier Finkel, Pierre Simonnet: On the Continuity Set of an omega Rational Function. CoRR abs/0801.3912 (2008)

i14

Olivier Finkel: On Winning Conditions of High Borel Complexity in Pushdown Games. CoRR abs/0803.1830 (2008)

i13

Olivier Finkel: On the Topological Complexity of Infinitary Rational Relations. CoRR abs/0803.1841 (2008)

i12

Olivier Finkel: Closure Properties of Locally Finite Omega Languages. CoRR abs/0803.1842 (2008)

i11

Olivier Finkel: Wadge Degrees of Infinitary Rational Relations. CoRR abs/0804.3266 (2008)

i10

Olivier Finkel: Topological Complexity of Context-Free omega-Languages: A Survey. CoRR abs/0806.1413 (2008)

Olivier Finkel, Dominique Lecomte: Topological Complexity of omega-Powers : Extended Abstract. CoRR abs/0809.1812 (2008)

Olivier Finkel: Highly Undecidable Problems about Recognizability by Tiling Systems. CoRR abs/0811.3704 (2008)

2007

j22

Olivier Finkel: An Example of Pi⁰₃-complete Infinitary Rational Relation. The Computer Science Journal of Moldova 15(1): 3-21 (2007)

j21

Olivier Finkel, Stevo Todorcevic: Local sentences and Mahlo cardinals. Math. Log. Q. 53(6): 558-563 (2007)

Olivier Finkel, Dominique Lecomte: There Exist Some omega -Powers of Any Borel Rank. CSL 2007: 115-129

Dominique Lecomte, Olivier Finkel: There Exist some Omega-Powers of Any Borel Rank. CoRR abs/0706.3523 (2007)

Olivier Finkel, Dominique Lecomte: Classical and Effective Descriptive Complexities of omega-Powers. CoRR abs/0708.4176 (2007)

Olivier Finkel: On Decidability Properties of Local Sentences. CoRR abs/0712.0164 (2007)

Olivier Finkel: On the Accepting Power of 2-Tape Büchi Automata. CoRR abs/0712.0165 (2007)

Olivier Finkel: Borel Ranks and Wadge Degrees of Context Free Omega Languages. CoRR abs/0712.1359 (2007)

Olivier Finkel: Undecidable Problems About Timed Automata. CoRR abs/0712.1363 (2007)

Olivier Finkel: An Example of Pi^0_3-complete Infinitary Rational Relation. CoRR abs/math/0702334 (2007)

2006

j20

Olivier Finkel: On the Shuffle of Regular Timed Languages. Bulletin of the EATCS 88: 182-184 (2006)

j19

Olivier Finkel: Borel ranks and Wadge degrees of context free omega-languages. Mathematical Structures in Computer Science 16(5): 813-840 (2006)

j18

Olivier Finkel: On decidability properties of local sentences. Theor. Comput. Sci. 364(2): 196-211 (2006)

Olivier Finkel: Undecidable Problems About Timed Automata. FORMATS 2006: 187-199

Olivier Finkel: On the Accepting Power of 2-Tape Büchi Automata. STACS 2006: 301-312

2005

j17

Olivier Finkel: On Decision Problems for Timed Automata. Bulletin of the EATCS 87: 185-190 (2005)

j16

Olivier Finkel: On Decidability Properties of Local Sentences. Electr. Notes Theor. Comput. Sci. 123: 75-92 (2005)

j15

Olivier Finkel: On Winning Conditions of High Borel Complexity in Pushdown Games. Fundam. Inform. 66(3): 277-298 (2005)

j14

Olivier Finkel: On the Length of the Wadge Hierarchy of Omega-Context Free Languages. Journal of Automata, Languages and Combinatorics 10(4): 439-464 (2005)

Olivier Finkel: Borel Ranks and Wadge Degrees of Context Free omega-Languages. CiE 2005: 129-138

2004

j13

Olivier Finkel: An omega-Power of a Finitary Language Which is a Borel Set of Infinite Rank. Fundam. Inform. 62(3-4): 333-342 (2004)

j12

Olivier Finkel: On Recognizable Languages Of Infinite Pictures. Int. J. Found. Comput. Sci. 15(6): 823-840 (2004)

j11

Olivier Finkel: Closure properties of locally finite omega-languages. Theor. Comput. Sci. 322(1): 69-84 (2004)

2003

j10

Olivier Finkel: On the Topological Complexity of Infinitary Rational Relations. ITA 37(2): 105-113 (2003)

Olivier Finkel: Undecidability of Topological and Arithmetical Properties of Infinitary Rational Relations. ITA 37(2): 115-126 (2003)

Olivier Finkel: On omega context free languages which are Borel sets of infinite rank. Theor. Comput. Sci. 1-3(299): 327-346 (2003)

Olivier Finkel: Ambiguity in omega context free languages. Theor. Comput. Sci. 1-3(301): 217-270 (2003)

Olivier Finkel: Borel hierarchy and omega context free languages. Theor. Comput. Sci. 290(3): 1385-1405 (2003)

Olivier Finkel: On Infinitary Rational Relations and Borel Sets. DMTCS 2003: 155-167

2001

Olivier Finkel: Locally finite languages. Theor. Comput. Sci. 255(1-2): 223-261 (2001)

Jacques Duparc, Olivier Finkel, Jean-Pierre Ressayre: Computer science and the fine structure of Borel sets. Theor. Comput. Sci. 257(1-2): 85-105 (2001)

Olivier Finkel: Topological properties of omega context-free languages. Theor. Comput. Sci. 262(1): 669-697 (2001)

Olivier Finkel: Wadge hierarchy of omega context-free languages. Theor. Comput. Sci. 269(1-2): 283-315 (2001)

Olivier Finkel: An Effective Extension of the Wagner Hierarchy to Blind Counter Automata. CSL 2001: 369-383

1996

Olivier Finkel, Jean-Pierre Ressayre: Stretchings. J. Symb. Log. 61(2): 563-585 (1996)

1	Olivier Carton	[j24] [i15]
2	Jacques Duparc	[c8] [i16] [j4]
3	Dominique Lecomte	[j31] [j27] [i22] [i9] [c6] [i7] [i6]
4	Jean-Pierre Ressayre	[c8] [i17] [j4] [j1]
5	Pierre Simonnet	[j28] [i23] [j24] [i20] [i17] [i15]
6	Stevo Todorcevic	[j37] [j35] [i38] [i32] [i27] [j21]

Olivier Finkel

Coauthor Index