default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOlivier Finkel
Person information
- affiliation: Pierre and Marie Curie University, Paris, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[i49]Olivier Finkel, Dominique Lecomte:
Wadge degrees of Δ02 omega-powers. CoRR abs/2407.10520 (2024)- 2023
- [j50]Olivier Finkel, Vesa Halava, Tero Harju
, Esa Sahla:
On bi-infinite and conjugate post correspondence problems. RAIRO Theor. Informatics Appl. 57: 7 (2023) - 2021
- [j49]Olivier Finkel, Dominique Lecomte:
Some complete ømega-powers of a one-counter language, for any Borel class of finite rank. Arch. Math. Log. 60(1-2): 161-187 (2021) - [j48]Olivier Finkel, Michal Skrzypczak:
On the Expressive Power of Non-deterministic and Unambiguous Petri Nets over Infinite Words. Fundam. Informaticae 183(3-4): 243-291 (2021) - [j47]Olivier Finkel:
Two Effective Properties of ω-Rational Functions. Int. J. Found. Comput. Sci. 32(7): 901-920 (2021) - [i48]Olivier Finkel, Michal Skrzypczak:
On the expressive power of non-deterministic and unambiguous Petri nets over infinite words. CoRR abs/2107.04025 (2021) - 2020
- [c16]Olivier Finkel:
On the High Complexity of Petri Nets ømega-Languages. Petri Nets 2020: 69-88 - [c15]Olivier Finkel:
The Automatic Baire Property and an Effective Property of ømega-Rational Functions. LATA 2020: 303-314 - [i47]Olivier Finkel, Dominique Lecomte:
Some complete ω-powers of a one-counter language, for any Borel class of finite rank. CoRR abs/2006.08174 (2020) - [i46]Olivier Finkel, Dominique Lecomte:
Descriptive Set Theory and ω-Powers of Finitary Languages. CoRR abs/2007.08636 (2020)
2010 – 2019
- 2019
- [j46]Olivier Finkel:
Incompleteness Theorems, Large Cardinals, and Automata Over Finite Words. Int. J. Found. Comput. Sci. 30(3): 449-467 (2019) - [j45]Jérémie Cabessa, Olivier Finkel:
Computational capabilities of analog and evolving neural networks over infinite input streams. J. Comput. Syst. Sci. 101: 86-99 (2019) - [j44]Olivier Finkel, Olivier Carton, Dominique Lecomte:
Polishness of some topologies related to word or tree automata. Log. Methods Comput. Sci. 15(2) (2019) - 2018
- [i45]Olivier Finkel:
An Effective Property of ω-Rational Functions. CoRR abs/1809.03220 (2018) - 2017
- [c14]Olivier Carton, Olivier Finkel, Dominique Lecomte:
Polishness of Some Topologies Related to Automata. CSL 2017: 22:1-22:16 - [c13]Jérémie Cabessa, Olivier Finkel:
Expressive Power of Evolving Neural Networks Working on Infinite Input Streams. FCT 2017: 150-163 - [c12]Olivier Finkel:
Incompleteness Theorems, Large Cardinals, and Automata over Finite Words. TAMC 2017: 231-246 - [i44]Olivier Finkel, Olivier Carton, Dominique Lecomte:
Polishness of some topologies related to automata (Extended version). CoRR abs/1710.04002 (2017) - [i43]Olivier Finkel:
Wadge Degrees of ω-Languages of Petri Nets. CoRR abs/1712.07945 (2017) - 2016
- [j43]Olivier Finkel:
Infinite games specified by 2-tape automata. Ann. Pure Appl. Log. 167(12): 1184-1212 (2016) - [j42]Olivier Finkel:
Locally finite ω-languages and effective analytic sets have the same topological complexity. Math. Log. Q. 62(4-5): 303-318 (2016) - 2015
- [j41]Olivier Finkel:
The exact complexity of the infinite Post Correspondence Problem. Inf. Process. Lett. 115(6-8): 609-611 (2015) - [j40]Olivier Finkel, Dominique Lecomte, Pierre Simonnet:
An upper bound on the complexity of recognizable tree languages. RAIRO Theor. Informatics Appl. 49(2): 121-137 (2015) - [c11]Olivier Finkel:
Incompleteness Theorems, Large Cardinals, and Automata over Infinite Words. ICALP (2) 2015: 222-233 - [i42]Olivier Finkel, Dominique Lecomte, Pierre Simonnet:
An Upper Bound on the Complexity of Recognizable Tree Languages. CoRR abs/1503.02840 (2015) - 2014
- [j39]Olivier Finkel:
Ambiguity of omega-Languages of Turing Machines. Log. Methods Comput. Sci. 10(3) (2014) - [j38]Olivier Finkel, Michal Skrzypczak:
On the topological complexity of ω-languages of non-deterministic Petri nets. Inf. Process. Lett. 114(5): 229-233 (2014) - [c10]Olivier Finkel:
Topological Complexity of Context-Free ω-Languages: A Survey. Language, Culture, Computation (1) 2014: 50-77 - [p1]Jacques Duparc, Olivier Finkel, Jean-Pierre Ressayre:
The wadge hierarchy of Petri Nets ω-languages. Logic, Computation, Hierarchies 2014: 109-138 - [i41]Olivier Finkel, Michal Skrzypczak:
On the Topological Complexity of omega-Languages of Non-Deterministic Petri Nets. CoRR abs/1401.6835 (2014) - 2013
- [j37]Olivier Finkel, Stevo Todorcevic:
Automatic Ordinals. Int. J. Unconv. Comput. 9(1-2): 61-70 (2013) - [j36]Olivier Finkel:
The determinacy of context-free games. J. Symb. Log. 78(4): 1115-1134 (2013) - [c9]Jacques Duparc, Olivier Finkel, Jean-Pierre Ressayre:
The Wadge Hierarchy of Petri Nets ω-Languages. LFCS 2013: 179-193 - [i40]Olivier Finkel:
The Determinacy of Context-Free Games. CoRR abs/1312.3412 (2013) - [i39]Olivier Finkel:
Infinite Games Specified by 2-Tape Automata. CoRR abs/1312.3797 (2013) - 2012
- [j35]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) - [j34]Olivier Finkel, Stevo Todorcevic:
A hierarchy of tree-automatic structures. J. Symb. Log. 77(1): 350-368 (2012) - [c8]Olivier Finkel:
The Determinacy of Context-Free Games. STACS 2012: 555-566 - [i38]Olivier Finkel, Stevo Todorcevic:
Automatic Ordinals. CoRR abs/1205.1775 (2012) - 2011
- [j33]Olivier Finkel:
Some problems in automata theory which depend on the models of set theory. RAIRO Theor. Informatics Appl. 45(4): 383-397 (2011) - [j32]Olivier Finkel:
On Decidability Properties of One-Dimensional Cellular Automata. J. Cell. Autom. 6(2-3): 181-193 (2011) - [i37]Olivier Finkel:
Borel Hierarchy and Omega Context Free Languages. CoRR abs/1101.3443 (2011) - [i36]Olivier Finkel:
Three Applications to Rational Relations of the High Undecidability of the Infinite Post Correspondence Problem in a Regular omega-Language. CoRR abs/1107.5886 (2011) - [i35]Olivier Finkel:
Decision Problems for Recognizable Languages of Infinite Pictures. CoRR abs/1107.5896 (2011) - [i34]Olivier Finkel:
Some Problems in Automata Theory Which Depend on the Models of Set Theory. CoRR abs/1108.2864 (2011) - [i33]Olivier Finkel, Stevo Todorcevic:
A Hierarchy of Tree-Automatic Structures. CoRR abs/1111.1504 (2011) - [i32]Olivier Finkel:
The Determinacy of Context-Free Games. CoRR abs/1112.1186 (2011) - 2010
- [j31]Olivier Finkel:
On some sets of dictionaries whose omega -powers have a given. Math. Log. Q. 56(5): 452-460 (2010) - [i31]Olivier Finkel:
On Infinitary Rational Relations and Borel Sets. CoRR abs/1005.5608 (2010) - [i30]Olivier Finkel:
On Omega Context Free Languages which are Borel Sets of Infinite Rank. CoRR abs/1005.5633 (2010) - [i29]Olivier Finkel:
An Effective Extension of the Wagner Hierarchy to Blind Counter Automata. CoRR abs/1005.5635 (2010) - [i28]Olivier Finkel, Stevo Todorcevic:
The Isomorphism Relation Between Tree-Automatic Structures. CoRR abs/1007.0822 (2010)
2000 – 2009
- 2009
- [j30]Olivier Finkel, Dominique Lecomte:
Classical and effective descriptive complexities of omega-powers. Ann. Pure Appl. Log. 160(2): 163-191 (2009) - [j29]Olivier Finkel:
The Complexity of Infinite Computations In Models of Set Theory. Log. Methods Comput. Sci. 5(4) (2009) - [j28]Olivier Finkel:
Highly Undecidable Problems about Recognizability by Tiling Systems. Fundam. Informaticae 91(2): 305-323 (2009) - [j27]Olivier Finkel, Pierre Simonnet:
On Recognizable Tree Languages Beyond the Borel Hierarchy. Fundam. Informaticae 95(2-3): 287-303 (2009) - [j26]Olivier Finkel, Dominique Lecomte:
Decision problems for Turing machines. Inf. Process. Lett. 109(23-24): 1223-1226 (2009) - [j25]Olivier Finkel:
Highly Undecidable Problems For Infinite Computations. RAIRO Theor. Informatics Appl. 43(2): 339-364 (2009) - [i27]Olivier Finkel:
Highly Undecidable Problems For Infinite Computations. CoRR abs/0901.0373 (2009) - [i26]Olivier Finkel:
On Recognizable Languages of Infinite Pictures. CoRR abs/0901.3828 (2009) - [i25]Olivier Finkel:
On Decidability Properties of One-Dimensional Cellular Automata. CoRR abs/0903.4615 (2009) - [i24]Olivier Finkel, Pierre Simonnet:
On Recognizable Tree Languages Beyond the Borel Hierarchy. CoRR abs/0909.0393 (2009) - [i23]Olivier Finkel, Dominique Lecomte:
Decision Problems For Turing Machines. CoRR abs/0909.0736 (2009) - [i22]Olivier Finkel:
On Some Sets of Dictionaries Whose omega-Powers Have a Given Complexity. CoRR abs/0911.3307 (2009) - 2008
- [j24]Olivier Finkel:
Topological complexity of locally finite omega -languages. Arch. Math. Log. 47(6): 625-651 (2008) - [j23]Olivier Carton, Olivier Finkel, Pierre Simonnet:
On the continuity set of an Omega rational function. RAIRO Theor. Informatics Appl. 42(1): 183-196 (2008) - [j22]Olivier Finkel:
Wadge Degrees of Infinitary Rational Relations. Math. Comput. Sci. 2(1): 85-102 (2008) - [i21]Olivier Finkel, Dominique Lecomte:
Topological Complexity of omega-Powers: Extended Abstract. Topological and Game-Theoretic Aspects of Infinite Computations 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
- [j21]Olivier Finkel:
An Example of ∏03-complete Infinitary Rational Relation. Comput. Sci. J. Moldova 15(1): 3-21 (2007) - [j20]Olivier Finkel, Stevo Todorcevic:
Local sentences and Mahlo cardinals. Math. Log. Q. 53(6): 558-563 (2007) - [c7]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
- [j19]Olivier Finkel:
On the Shuffle of Regular Timed Languages. Bull. EATCS 88: 182-184 (2006) - [j18]Olivier Finkel:
Borel ranks and Wadge degrees of context free omega-languages. Math. Struct. Comput. Sci. 16(5): 813-840 (2006) - [j17]Olivier Finkel:
On decidability properties of local sentences. Theor. Comput. Sci. 364(2): 196-211 (2006) - [c6]Olivier Finkel:
Undecidable Problems About Timed Automata. FORMATS 2006: 187-199 - [c5]Olivier Finkel:
On the Accepting Power of 2-Tape Büchi Automata. STACS 2006: 301-312 - 2005
- [j16]Olivier Finkel:
On Decision Problems for Timed Automata. Bull. EATCS 87: 185-190 (2005) - [j15]Olivier Finkel:
On Winning Conditions of High Borel Complexity in Pushdown Games. Fundam. Informaticae 66(3): 277-298 (2005) - [j14]Olivier Finkel:
On the Length of the Wadge Hierarchy of ω-Context Free Languages. J. Autom. Lang. Comb. 10(4): 439-464 (2005) - [c4]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. Informaticae 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) - [c3]Olivier Finkel:
On Decidability Properties of Local Sentences. WoLLIC 2004: 75-92 - 2003
- [j10]Olivier Finkel:
On the Topological Complexity of Infinitary Rational Relations. RAIRO Theor. Informatics Appl. 37(2): 105-113 (2003) - [j9]Olivier Finkel:
Undecidability of Topological and Arithmetical Properties of Infinitary Rational Relations. RAIRO Theor. Informatics Appl. 37(2): 115-126 (2003) - [j8]Olivier Finkel:
Borel hierarchy and omega context free languages. Theor. Comput. Sci. 290(3): 1385-1405 (2003) - [j7]Olivier Finkel:
On omega context free languages which are Borel sets of infinite rank. Theor. Comput. Sci. 299(1-3): 327-346 (2003) - [j6]Olivier Finkel:
Ambiguity in omega context free languages. Theor. Comput. Sci. 301(1-3): 217-270 (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
1990 – 1999
- 1996
- [j1]Olivier Finkel, Jean-Pierre Ressayre:
Stretchings. J. Symb. Log. 61(2): 563-585 (1996)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:09 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
