LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
On the Equational Definition of the Least Prefixed Point
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Deciding the First Level of the µ-Calculus Alternation Hierarchy
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
On the equational definition of the least prefixed point
Theoretical Computer Science - Mathematical foundations of computer science
A gap property of deterministic tree languages
Theoretical Computer Science - Logic and complexity in computer science
An extension theorem with an application to formal tree series
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the workshop weighted automata: Theory and applications (Dresden University of Technology (Germany), March 4-8, 2002)
Mu-depth 3 is more than 2: a game-theoretic proof
Mathematical Structures in Computer Science
Towards the hierarchical verification of reactive systems
Theoretical Computer Science - Logic, semantics and theory of programming
Combining supervisor synthesis and model checking
ACM Transactions on Embedded Computing Systems (TECS)
Information Processing Letters
On the universal and existential fragments of the μ-calculus
Theoretical Computer Science - Tools and algorithms for the construction and analysis of systems (TACAS 2003)
Ambiguous classes in µ-calculi hierarchies
Theoretical Computer Science - Foundations of software science and computation structures
Fuzzy Sets and Systems
Continuous Separation of Game Languages
Fundamenta Informaticae - Topics in Logic, Philosophy and Foundations of Mathematics and Computer Science. In Recognition of Professor Andrzej Grzegorczyk
The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Iteration Grove Theories with Applications
CAI '09 Proceedings of the 3rd International Conference on Algebraic Informatics
Deciding Nondeterministic Hierarchy of Deterministic Tree Automata
Electronic Notes in Theoretical Computer Science (ENTCS)
Information Processing Letters
Automatic verification of sequential infinite-state processes
Automatic verification of sequential infinite-state processes
Ambiguous classes in the games µ-calculus hierarchy
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Linear game automata: decidable hierarchy problems for stripped-down alternating tree automata
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
On deciding topological classes of deterministic tree languages
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Kleene theorem in partial conway theories with applications
Algebraic Foundations in Computer Science
On topological completeness of regular tree languages
Logic and Program Semantics
Continuous Separation of Game Languages
Fundamenta Informaticae - Topics in Logic, Philosophy and Foundations of Mathematics and Computer Science. In Recognition of Professor Andrzej Grzegorczyk
A Characterization Theorem for the Alternation-Free Fragment of the Modal µ-Calculus
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
Hi-index | 0.00 |