Decidability of bisimulation equivalence for normed pushdown processes
Theoretical Computer Science
Introduction to Formal Language Theory
Introduction to Formal Language Theory
Languages Defined by Higher Type Program Schemes
Proceedings of the Fourth Colloquium on Automata, Languages and Programming
The Equivalence Problem for Deterministic Pushdown Automata is Decidable
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Journal of Computer and System Sciences
Program schemes, recursion schemes, and formal languages
Journal of Computer and System Sciences
| Hi-index | 0.00 |