MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
The Delta Operation: From Strings to Trees to Strings
Formal and Natural Computing - Essays Dedicated to Grzegorz Rozenberg [on occasion of his 60th birthday, March 14, 2002]
An Effective Extension of the Wagner Hierarchy to Blind Counter Automata
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
The delta operation: from strings to trees to strings
Formal and natural computing
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
Automata logics, and infinite games
Weak Muller acceptance conditions for tree automata
Theoretical Computer Science
Towards a descriptive set theory for domain-like structures
Theoretical Computer Science - Spatial representation: Discrete vs. continous computational models
On the length of the Wadge hierarchy of ω-context-free languages
Journal of Automata, Languages and Combinatorics
Blind Counter Automata on ω-Words
Fundamenta Informaticae
Regular ω-Languages Defined by Finite Extended Spiking Neural P Systems
Fundamenta Informaticae
Fine hierarchies and m-reducibilities in theoretical computer science
Theoretical Computer Science
Highly Undecidable Problems about Recognizability by Tiling Systems
Fundamenta Informaticae - Machines, Computations and Universality, Part II
Decision problems for Turing machines
Information Processing Letters
Tiling systems over infinite pictures and their acceptance conditions
DLT'02 Proceedings of the 6th international conference on Developments in language theory
On infinitary rational relations and Borel sets
DMTCS'03 Proceedings of the 4th international conference on Discrete mathematics and theoretical computer science
A note on accelerated turing machines
Mathematical Structures in Computer Science
Topological properties of forbidding-enforcing systems
Journal of Automata, Languages and Combinatorics
On the accepting power of 2-tape büchi automata
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Foundations for the run-time monitoring of reactive systems: fundamentals of the MaC language
ICTAC'04 Proceedings of the First international conference on Theoretical Aspects of Computing
Borel ranks and wadge degrees of context free ω-languages
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
The expressive power of analog recurrent neural networks on infinite input streams
Theoretical Computer Science
On the Generative Power of ω-Grammars and ω-Automata
Fundamenta Informaticae
Highly Undecidable Problems about Recognizability by Tiling Systems
Fundamenta Informaticae - Machines, Computations and Universality, Part II
Blind Counter Automata on ω-Words
Fundamenta Informaticae
Regular ω-Languages Defined by Finite Extended Spiking Neural P Systems
Fundamenta Informaticae
On the topological complexity of ω-languages of non-deterministic Petri nets
Information Processing Letters
| Hi-index | 5.23 |