Two Effective Properties of omega-Rational Functions | 0 | 0.34 | 2021 |
Some complete ømega-powers of a one-counter language, for any Borel class of finite rank. | 0 | 0.34 | 2021 |
Polishness of some topologies related to word or tree automata. | 0 | 0.34 | 2019 |
Computational capabilities of analog and evolving neural networks over infinite input streams. | 0 | 0.34 | 2019 |
Polishness of Some Topologies Related to Automata. | 0 | 0.34 | 2017 |
Expressive Power of Evolving Neural Networks Working on Infinite Input Streams. | 1 | 0.35 | 2017 |
Incompleteness Theorems, Large Cardinals, and Automata over Finite Words. | 0 | 0.34 | 2017 |
Locally finite ω-languages and effective analytic sets have the same topological complexity. | 0 | 0.34 | 2016 |
An Upper Bound on the Complexity of Recognizable Tree Languages. | 1 | 0.37 | 2015 |
The exact complexity of the infinite Post Correspondence Problem | 0 | 0.34 | 2015 |
On the Topological Complexity of omega-Languages of Non-Deterministic Petri Nets. | 0 | 0.34 | 2014 |
On the topological complexity of ω-languages of non-deterministic Petri nets | 0 | 0.34 | 2014 |
Infinite games specified by 2-tape automata | 2 | 0.36 | 2013 |
The wadge hierarchy of Petri Nets ω-languages. | 2 | 0.43 | 2013 |
Automatic Ordinals | 0 | 0.34 | 2013 |
The determinacy of context-free games. | 1 | 0.35 | 2012 |
Three Applications To Rational Relations Of The High Undecidability Of The Infinite Post Correspondence Problem In A Regular Omega-Language | 1 | 0.36 | 2012 |
Ambiguity of omega-Languages of Turing Machines | 5 | 0.44 | 2012 |
Borel hierarchy and omega context free languages | 19 | 1.25 | 2011 |
A Hierarchy of Tree-Automatic Structures | 3 | 0.48 | 2011 |
Decision Problems for Recognizable Languages of Infinite Pictures | 2 | 0.42 | 2011 |
On Decidability Properties of One-Dimensional Cellular Automata. | 2 | 0.38 | 2011 |
Some Problems in Automata Theory Which Depend on the Models of Set Theory | 1 | 0.37 | 2011 |
Three Applications to Rational | 0 | 0.34 | 2011 |
On infinitary rational relations and Borel sets | 4 | 0.51 | 2010 |
The Isomorphism Relation Between Tree-Automatic Structures | 3 | 0.41 | 2010 |
An Effective Extension of the Wagner Hierarchy to Blind Counter Automata | 6 | 0.61 | 2010 |
On some sets of dictionaries whose omega -powers have a given. | 0 | 0.34 | 2010 |
Decision problems for Turing machines | 4 | 0.53 | 2009 |
On Some Sets of Dictionaries Whose omega-Powers Have a Given Complexity | 0 | 0.34 | 2009 |
Highly Undecidable Problems For Infinite Computations | 10 | 1.03 | 2009 |
The Complexity of Infinite Computations In Models of Set Theory | 0 | 0.34 | 2009 |
On Recognizable Tree Languages Beyond the Borel Hierarchy | 8 | 0.89 | 2009 |
The Complexity of Infinite Computations In Models of Set Theory | 4 | 0.50 | 2009 |
Classical and Effective Descriptive Complexities of omega-Powers | 3 | 0.47 | 2009 |
Topological Complexity Of Locally Finite Omega-Languages | 1 | 0.38 | 2008 |
Topological Complexity of omega-Powers: Extended Abstract. | 0 | 0.34 | 2008 |
On Winning Conditions of High Borel Complexity in Pushdown Games | 0 | 0.34 | 2008 |
Wadge Degrees of Infinitary Rational Relations | 1 | 0.36 | 2008 |
Topology and Ambiguity in Omega Context Free Languages | 5 | 0.56 | 2008 |
Highly Undecidable Problems about Recognizability by Tiling Systems | 1 | 0.39 | 2008 |
An omega-power of a context-free language which is Borel above Delta^0_omega | 0 | 0.34 | 2008 |
On the Continuity Set of an omega Rational Function | 2 | 0.41 | 2008 |
Local sentences and Mahlo cardinals | 0 | 0.34 | 2007 |
There Exist Some omega -Powers of Any Borel Rank. | 0 | 0.34 | 2007 |
An Example of ∏-complete Infinitary Rational Relation. | 0 | 0.34 | 2007 |
On the accepting power of 2-tape büchi automata | 6 | 0.54 | 2006 |
Undecidable problems about timed automata | 22 | 0.87 | 2006 |
On the Shuffle of Regular Timed Languages. | 1 | 0.35 | 2006 |
On Decision Problems for Timed Automata | 5 | 0.53 | 2005 |