Efficient Verification Algorithms for One-Counter Processes
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
On the complexity of a problem on monadic string rewriting systems
Journal of Automata, Languages and Combinatorics - Third international workshop on descriptional complexity of automata, grammars and related structures
The complexity of bisimilarity-checking for one-counter processes
Theoretical Computer Science
Hi-index | 0.00 |