On the containment and equivalence of database queries with linear constraints (extended abstract)
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Counter machines and verification Problems
Theoretical Computer Science
Conter Machines: Decidable Properties and Applications to Verification Problems
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Decision Questions Concerning Semilinearity, Morphisms, and Commutation of Languages
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
On the Emptiness Problem for Two-Way NFA with One Reversal-Bounded Counter
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Decidable Approximations on Generalized and Parameterized Discrete Timed Automata
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Generalized discrete timed automata: decidable approximations for safety verification
Theoretical Computer Science - Computing and combinatorics
Pushdown timed automata: a binary reachability characterization and safety verification
Theoretical Computer Science
On two-way FA with monotonic counters and quadratic Diophantine equations
Theoretical Computer Science
On two-way nondeterministic finite automata with one reversal-bounded counter
Theoretical Computer Science - Insightful theory
On the solvability of a class of diophantine equations and applications
Theoretical Computer Science
On composition and lookahead delegation of e-services modeled by automata
Theoretical Computer Science
Flat Parametric Counter Automata
Fundamenta Informaticae - Machines, Computations and Universality, Part II
Safety verification for two-way finite automata with monotonic counters
DLT'02 Proceedings of the 6th international conference on Developments in language theory
On synchronized multitape and multihead automata
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
Descriptional complexity of two-way pushdown automata with restricted head reversals
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
Composability of infinite-state activity automata
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Real-Counter automata and their decision problems
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
On synchronized multi-tape and multi-head automata
Theoretical Computer Science
Descriptional complexity of two-way pushdown automata with restricted head reversals
Theoretical Computer Science
Flat Parametric Counter Automata
Fundamenta Informaticae - Machines, Computations and Universality, Part II
Similarity in languages and programs
Theoretical Computer Science
| Hi-index | 0.01 |
The authors study some decision questions concerning two-way counter machines and obtain the strongest decidable results to date concerning these machines. In particular, it is shown that the emptiness, containment, and equivalence (ECE, for short) problems are decidable for two-way counter machines whose counter is reversal-bounded (i.e., the counter alternates between increasing and decreasing modes at most a fixed number of times). This result is used to give a simpler proof of a recent result in which the ECE problems for two-way reversal-bounded pushdown automata accepting bounded languages (i.e., subsets of $w_1^*\ldots w_k^*$ for some nonnull words $w_1,\ldots,w_k$) are decidable. Other applications concern decision questions about simple programs. Finally, it is shown that nondeterministic two-way reversal-bounded multicounter machines are effectively equivalent to finite automata on unary languages, and hence their ECE problems are decidable also.