Learning branches and learning to win closed games
COLT '96 Proceedings of the ninth annual conference on Computational learning theory
An Effective Extension of the Wagner Hierarchy to Blind Counter Automata
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Borel hierarchy and omega context free languages
Theoretical Computer Science
On omega context free languages which are Borel sets of infinite rank
Theoretical Computer Science
Ambiguity in omega context free languages
Theoretical Computer Science
An ω-Power of a Finitary Language Which is a Borel Set of Infinite Rank
Fundamenta Informaticae
On Effective Methods for Diagnosis of Retaining Faults in Circuits
Fundamenta Informaticae
On the length of the Wadge hierarchy of ω-context-free languages
Journal of Automata, Languages and Combinatorics
Highly Undecidable Problems about Recognizability by Tiling Systems
Fundamenta Informaticae - Machines, Computations and Universality, Part II
Decision problems for Turing machines
Information Processing Letters
On Recognizable Tree Languages Beyond the Borel Hierarchy
Fundamenta Informaticae
On infinitary rational relations and Borel sets
DMTCS'03 Proceedings of the 4th international conference on Discrete mathematics and theoretical computer science
Expressing Cardinality Quantifiers in Monadic Second-Order Logic over Trees
Fundamenta Informaticae - Understanding Computers' Intelligence Celebrating the 100th Volume of Fundamenta Informaticae in Honour of Helena Rasiowa
On the topological complexity of MSO+U and related automata models
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Logic and games on automatic structures: playing with quantifiers and decompositions
Logic and games on automatic structures: playing with quantifiers and decompositions
On the accepting power of 2-tape büchi automata
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Degrees of lookahead in regular infinite games
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
Borel ranks and wadge degrees of context free ω-languages
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
Highly Undecidable Problems about Recognizability by Tiling Systems
Fundamenta Informaticae - Machines, Computations and Universality, Part II
On Recognizable Tree Languages Beyond the Borel Hierarchy
Fundamenta Informaticae
On Winning Conditions of High Borel Complexity in Pushdown Games
Fundamenta Informaticae
An ω-Power of a Finitary Language Which is a Borel Set of Infinite Rank
Fundamenta Informaticae
The Topological Complexity of MSO+U and Related Automata Models
Fundamenta Informaticae - Emergent Computing
There exist some ω-powers of any Borel rank
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Topological extension of parity automata
Information and Computation
On the topological complexity of ω-languages of non-deterministic Petri nets
Information Processing Letters
| Hi-index | 0.00 |