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 Variable Hierarchy of the Modal µ-Calculus
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
Automata logics, and infinite games
Mu-depth 3 is more than 2: a game-theoretic proof
Mathematical Structures in Computer Science
The alternation hierarchy in fixpoint logic with chop is strict too
Information and Computation
Ambiguous classes in µ-calculi hierarchies
Theoretical Computer Science - Foundations of software science and computation structures
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
Deciding Nondeterministic Hierarchy of Deterministic Tree Automata
Electronic Notes in Theoretical Computer Science (ENTCS)
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
The variable hierarchy of the µ-calculus is strict
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
On deciding topological classes of deterministic tree languages
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Continuous Separation of Game Languages
Fundamenta Informaticae - Topics in Logic, Philosophy and Foundations of Mathematics and Computer Science. In Recognition of Professor Andrzej Grzegorczyk
Hi-index | 0.00 |