The following pages link to Olivier Finkel (Q324244):
Displayed 50 items.
- (Q197721) (redirect page) (← links)
- Infinite games specified by 2-tape automata (Q324245) (← links)
- The isomorphism relation between tree-automatic structures (Q707994) (← links)
- The automatic Baire property and an effective property of \(\omega\)-rational functions (Q782586) (← links)
- On decidability properties of local sentences (Q860837) (← links)
- Topological complexity of locally finite \(\omega\)-languages (Q944222) (← links)
- Decision problems for Turing machines (Q990079) (← links)
- Wadge degrees of infinitary rational relations (Q1001349) (← links)
- Ambiguity in omega context free languages (Q1399989) (← links)
- Borel hierarchy and omega context free languages. (Q1401165) (← links)
- Expressive power of evolving neural networks working on infinite input streams (Q1679966) (← links)
- Computational capabilities of analog and evolving neural networks over infinite input streams (Q1713481) (← links)
- Topology and ambiguity in \(\omega\)-context free languages (Q1781923) (← links)
- On omega context free languages which are Borel sets of infinite rank. (Q1874398) (← links)
- Closure properties of locally finite \(\omega\)-languages (Q1885033) (← links)
- Some complete \(\omega\)-powers of a one-counter language, for any Borel class of finite rank (Q2219094) (← links)
- Classical and effective descriptive complexities of \(\omega \)-powers (Q2271988) (← links)
- The exact complexity of the infinite Post Correspondence Problem (Q2345861) (← links)
- On the topological complexity of \(\omega\)-languages of non-deterministic Petri nets (Q2446063) (← links)
- An example of \(\boldsymbol{\Pi}_3^0\)-complete infinitary rational relation (Q2642354) (← links)
- Locally finite ω-languages and effective analytic sets have the same topological complexity (Q2827947) (← links)
- Ambiguity of {\omega}-Languages of Turing Machines (Q2878760) (← links)
- The Determinacy of Context-Free Games (Q2904793) (← links)
- Incompleteness Theorems, Large Cardinals, and Automata over Finite Words (Q2988824) (← links)
- (Q2998116) (← links)
- On some sets of dictionaries whose ω -powers have a given (Q3053226) (← links)
- Some problems in automata theory which depend on the models of set theory (Q3117545) (← links)
- Decision Problems for Recognizable Languages of Infinite Pictures (Q3172126) (← links)
- (Q3396573) (← links)
- (Q3396582) (← links)
- On Recognizable Tree Languages Beyond the Borel Hierarchy (Q3400555) (← links)
- The Complexity of Infinite Computations In Models of Set Theory (Q3401139) (← links)
- Borel ranks and Wadge degrees of context free $\omega$-languages (Q3422021) (← links)
- Incompleteness Theorems, Large Cardinals, and Automata over Infinite Words (Q3449478) (← links)
- The Wadge Hierarchy of Petri Nets ω-Languages (Q3455844) (← links)
- (Q3472087) (← links)
- (Q3509076) (← links)
- Undecidable Problems About Timed Automata (Q3511235) (← links)
- On the continuity set of an Omega rational function (Q3514642) (← links)
- There Exist Some ω-Powers of Any Borel Rank (Q3608408) (← links)
- Highly Undecidable Problems For Infinite Computations (Q3625697) (← links)
- Highly Undecidable Problems about Recognizability by Tiling Systems (Q3634001) (← links)
- (Q4452098) (← links)
- ON RECOGNIZABLE LANGUAGES OF INFINITE PICTURES (Q4652792) (← links)
- (Q4654268) (← links)
- (Q4783319) (← links)
- On the Topological Complexity of Infinitary Rational Relations (Q4825475) (← links)
- Undecidability of Topological and Arithmetical Properties of Infinitary Rational Relations (Q4825476) (← links)
- Stretchings (Q4894727) (← links)
- THREE APPLICATIONS TO RATIONAL RELATIONS OF THE HIGH UNDECIDABILITY OF THE INFINITE POST CORRESPONDENCE PROBLEM IN A REGULAR ω-LANGUAGE (Q4923292) (← links)