L(A)=L(B)? a simplified decidability proof
Theoretical Computer Science
Applications of Finite Automata
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Decision Questions Concerning Semilinearity, Morphisms, and Commutation of Languages
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Deciding DPDA Equivalence Is Primitive Recursive
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
An Introduction to Decidability of DPDA Equivalence
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
Model Checking Algol-Like Languages Using Game Semantics
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
Some Applications of the Decidability of DPDA's Equivalence
MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
On the computational complexity of bisimulation, redux
PCK50 Proceedings of the Paris C. Kanellakis memorial workshop on Principles of computing & knowledge: Paris C. Kanellakis memorial workshop on the occasion of his 50th birthday
Bisimulation and language equivalence
Logic for concurrency and synchronisation
On the computational complexity of bisimulation, redux
Information and Computation - Special issue: Commemorating the 50th birthday anniversary of Paris C. Kanellakis
About the undecidability of program equivalence in finitary languages with state
ACM Transactions on Computational Logic (TOCL)
Equivalence-checking on infinite-state systems: Techniques and results
Theory and Practice of Logic Programming
A general approach to comparing infinite-state systems with their finite-state specifications
Theoretical Computer Science - Concurrency theory (CONCUR 2004)
A characterization of regular expressions under bisimulation
Journal of the ACM (JACM)
Model-Checking Games for Typed λ-Calculi
Electronic Notes in Theoretical Computer Science (ENTCS)
Equivalence of deterministic pushdown automata revisited
Cybernetics and Systems Analysis
Undecidability of bisimilarity by defender's forcing
Journal of the ACM (JACM)
Selected Ideas Used for Decidability and Undecidability of Bisimilarity
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Rational subsets of partially reversible monoids
Theoretical Computer Science
On the computational complexity of bisimulation, redux
Information and Computation
The equivalence problem for t-turn dpda is co-NP
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Language equivalence of deterministic real-time one-counter automata is NL-complete
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Quasi-rocking real-time pushdown automata
Theoretical Computer Science
Undecidability results for bisimilarity on prefix rewrite systems
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Idealized algol with ground recursion, and DPDA equivalence
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Some non-semi-decidability problems for linear and deterministic context-free languages
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Context-Free grammars and XML languages
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
A note on controllability of deterministic context-free systems
Automatica (Journal of IFAC)
Decidability of DPDA Language Equivalence via First-Order Grammars
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Simple models for recursive schemes
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Regularity problems for weak pushdown ω-automata and games
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Equivalence of deterministic one-counter automata is NL-complete
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
From security protocols to pushdown automata
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
LALBLC a program testing the equivalence of dpda's
CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
Bisimulation equivalence and regularity for real-time one-counter automata
Journal of Computer and System Sciences
Bisimilarity of Pushdown Automata is Nonelementary
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 5.24 |