Name
Affiliation
Papers
OLIVIER FINKEL
Equipe de Logique Mathématique|Université Paris 7
61
Collaborators
Citations 
PageRank 
13
208
30.17
Referers 
Referees 
References 
146
201
541
Search Limit
100201
Title
Citations
PageRank
Year
Two Effective Properties of omega-Rational Functions00.342021
Some complete ømega-powers of a one-counter language, for any Borel class of finite rank.00.342021
Polishness of some topologies related to word or tree automata.00.342019
Computational capabilities of analog and evolving neural networks over infinite input streams.00.342019
Polishness of Some Topologies Related to Automata.00.342017
Expressive Power of Evolving Neural Networks Working on Infinite Input Streams.10.352017
Incompleteness Theorems, Large Cardinals, and Automata over Finite Words.00.342017
Locally finite ω-languages and effective analytic sets have the same topological complexity.00.342016
An Upper Bound on the Complexity of Recognizable Tree Languages.10.372015
The exact complexity of the infinite Post Correspondence Problem00.342015
On the Topological Complexity of omega-Languages of Non-Deterministic Petri Nets.00.342014
On the topological complexity of ω-languages of non-deterministic Petri nets00.342014
Infinite games specified by 2-tape automata20.362013
The wadge hierarchy of Petri Nets ω-languages.20.432013
Automatic Ordinals00.342013
The determinacy of context-free games.10.352012
Three Applications To Rational Relations Of The High Undecidability Of The Infinite Post Correspondence Problem In A Regular Omega-Language10.362012
Ambiguity of omega-Languages of Turing Machines50.442012
Borel hierarchy and omega context free languages191.252011
A Hierarchy of Tree-Automatic Structures30.482011
Decision Problems for Recognizable Languages of Infinite Pictures20.422011
On Decidability Properties of One-Dimensional Cellular Automata.20.382011
Some Problems in Automata Theory Which Depend on the Models of Set Theory10.372011
Three Applications to Rational 00.342011
On infinitary rational relations and Borel sets40.512010
The Isomorphism Relation Between Tree-Automatic Structures30.412010
An Effective Extension of the Wagner Hierarchy to Blind Counter Automata60.612010
On some sets of dictionaries whose omega -powers have a given.00.342010
Decision problems for Turing machines40.532009
On Some Sets of Dictionaries Whose omega-Powers Have a Given Complexity00.342009
Highly Undecidable Problems For Infinite Computations101.032009
The Complexity of Infinite Computations In Models of Set Theory00.342009
On Recognizable Tree Languages Beyond the Borel Hierarchy80.892009
The Complexity of Infinite Computations In Models of Set Theory40.502009
Classical and Effective Descriptive Complexities of omega-Powers30.472009
Topological Complexity Of Locally Finite Omega-Languages10.382008
Topological Complexity of omega-Powers: Extended Abstract.00.342008
On Winning Conditions of High Borel Complexity in Pushdown Games00.342008
Wadge Degrees of Infinitary Rational Relations10.362008
Topology and Ambiguity in Omega Context Free Languages50.562008
Highly Undecidable Problems about Recognizability by Tiling Systems10.392008
An omega-power of a context-free language which is Borel above Delta^0_omega00.342008
On the Continuity Set of an omega Rational Function20.412008
Local sentences and Mahlo cardinals00.342007
There Exist Some omega -Powers of Any Borel Rank.00.342007
An Example of ∏-complete Infinitary Rational Relation.00.342007
On the accepting power of 2-tape büchi automata60.542006
Undecidable problems about timed automata220.872006
On the Shuffle of Regular Timed Languages.10.352006
On Decision Problems for Timed Automata50.532005
  • 1
  • 2