The equivalence and inclusion problems for NTS languages
Journal of Computer and System Sciences
Decidability of bisimulation equivalence for processes generating context-free languages
Volume II: Parallel Languages on PARLE: Parallel Architectures and Languages Europe
Journal of Computer and System Sciences
On deciding the confluence of a finite string-rewriting system on a given congruence class
Journal of Computer and System Sciences
Some decision problems about controlled rewriting systems
Theoretical Computer Science
Handbook of theoretical computer science (vol. B)
Recursive applicative program schemes
Handbook of theoretical computer science (vol. B)
String-rewriting systems
Infinite hypergraphs: ii. systems of recursive equations
Theoretical Computer Science
The pre-NTS property is undecidable for context-free grammars
Information Processing Letters
On weakly confluent monadic string-rewriting systems
STACS '91 Selected papers of the 8th annual symposium on Theoretical aspects of computer science
An algebraic theory of graph reduction
Journal of the ACM (JACM)
Undecidable equivalences for basic process algebra
Information and Computation
Bisimulation equivalence is decidable for all context-free processes
Information and Computation
A polynomial algorithm testing partial confluence of basic semi-Thue systems
Theoretical Computer Science - Special issue: rewriting systems and applications
Journal of the ACM (JACM)
Complete formal systems for equivalence problems
Theoretical Computer Science - Special issue on universal machines and computations
L(A) = L(B)? decidability results from complete formal systems
Theoretical Computer Science
Type definitions with parameters
POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Communication and Concurrency
Algebraic Semantics
Graphic Apology for Symmetry and Implicitness
Graphic Apology for Symmetry and Implicitness
Word Processing in Groups
Automatic Graphs and Graph D0L-Systems
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Deciding the NTS Property of Context-Free Grammars
Proceedings of the Colloquium in Honor of Arto Salomaa on Results and Trends in Theoretical Computer Science
The Equivalence Problem for Deterministic Pushdown Automata is Decidable
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Bisimulation Equivalence is Decidable for One-Counter Processes
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Bisimulation Equivalence is Decidable for Basic Parallel Processes
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Decidability of Bisimulation Equivalence for Normed Pushdown Processes
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
FOSSACS '00 Proceedings of the Third International Conference on Foundations of Software Science and Computation Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software,ETAPS 2000
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Formal Languages and Word-Rewriting
Term Rewriting, French Spring School of Theoretical Computer Science, Advanced Course
Automatic Presentations of Structures
LCC '94 Selected Papers from the International Workshop on Logical and Computational Complexity
A Specialized Completion Procedure for Monadic String-Rewriting Systems Presenting Groups
ICALP '91 Proceedings of the 18th International Colloquium on Automata, Languages and Programming
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Decidability of Bisimulation Equivalence for Equational Graphs of Finite Out-Degree
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
On some families of languages related to the Dyck language
STOC '70 Proceedings of the second annual ACM symposium on Theory of computing
Automatic graphs and D0L-sequences of finite graphs
Journal of Computer and System Sciences
The Bisimulation Problem for Equational Graphs of Finite Out-Degree
SIAM Journal on Computing
A polynomial-time algorithm for deciding equivalence of normed context-free processes
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Regular expressions and the equivalence of programs
Journal of Computer and System Sciences
Program equivalence and context-free grammars
Journal of Computer and System Sciences
Equivalences on program schemes
Journal of Computer and System Sciences
On formalised computer programs
Journal of Computer and System Sciences
Program schemes, recursion schemes, and formal languages
Journal of Computer and System Sciences
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 |
The equivalence problem for deterministic pushdown automata has been shown decidable in [SÉn97c,SÉn97a,SÉn97b,SÉn01,Sti99]. We give some applications of this decidability result to other problems arising in the following areas of theoretical computer science: - programming languages theory - infinite graph theory - Thue-systems.