Decision problems in computational models
Proceedings of ACM conference on Proving assertions about programs
Computation: finite and infinite machines
Computation: finite and infinite machines
Formal languages and their relation to automata
Formal languages and their relation to automata
Regularity and Related Problems for Deterministic Pushdown Automata
Journal of the ACM (JACM)
Expressiveness Issues and Decision Problems for Active Database Event Queries
ICDT '01 Proceedings of the 8th International Conference on Database Theory
Conter Machines: Decidable Properties and Applications to Verification Problems
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Simulation Problems for One-Counter Machines
SOFSEM '99 Proceedings of the 26th Conference on Current Trends in Theory and Practice of Informatics on Theory and Practice of Informatics
The Equivalence Problem for Computational Models: Decidable and Undecidable Cases
MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
Learning one-counter languages in polynomial time
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
A result on the equivalence problem for deterministicpushdown automata
Journal of Computer and System Sciences
Bisimilarity of one-counter processes is PSPACE-complete
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
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
Space complexity vs. query complexity
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Equivalence of deterministic one-counter automata is NL-complete
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Bisimulation equivalence and regularity for real-time one-counter automata
Journal of Computer and System Sciences
| Hi-index | 0.00 |
The equivalence problem for deterministic one-counter automata is shown to bedecidable. A corollary for schema theory is that equivalence is decidable for Ianov schemas with an auxiliary counter.