Proceedings of the ACM SIGPLAN 1999 conference on Programming language design and implementation
Forty years of formal power series in automata theory
A half-century of automata theory
L(A)=L(B)? a simplified decidability proof
Theoretical Computer Science
Type-Safe linking with recursive DLLs and shared libraries
ACM Transactions on Programming Languages and Systems (TOPLAS)
On Infinite Terms Having a Decidable Monadic Theory
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Deciding DPDA Equivalence Is Primitive Recursive
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Techniques for Decidability and Undecidability of Bisimilarity
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Undecidability of Weak Bisimilarity for Pushdown Processes
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
An Introduction to Decidability of DPDA Equivalence
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
Equivalence-Checking with Infinite-State Systems: Techniques and Results
SOFSEM '02 Proceedings of the 29th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
On the Complexity of Bisimulation Problems for Pushdown Automata
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Some Applications of the Decidability of DPDA's Equivalence
MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
Complete Axioms for Categorical Fixed-Point Operators
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Deterministic finite automata with recursive calls and DPDAs
Information Processing Letters
Bisimulation and language equivalence
Logic for concurrency and synchronisation
On composition and lookahead delegation of e-services modeled by automata
Theoretical Computer Science
Equivalence of deterministic pushdown automata revisited
Cybernetics and Systems Analysis
Deterministic Pushdown Automata and Unary Languages
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
Automatic verification of sequential infinite-state processes
Automatic verification of sequential infinite-state processes
The equivalence problem for t-turn dpda is co-NP
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Equivalence of deterministic nested word to word transducers
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
A syntactic type system for recursive modules
Proceedings of the 2011 ACM international conference on Object oriented programming systems languages and applications
On the complexity of the equivalence problem for probabilistic automata
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
From security protocols to pushdown automata
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Contractive signatures with recursive types, type parameters, and abstract types
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
Hi-index | 0.00 |