New Decidability Results Concerning Two-Way Counter Machines
From MaRDI portal
Recommendations
- New decidability results concerning two-way counter machines and applications
- ON THE EQUIVALENCE OF TWO-WAY PUSHDOWN AUTOMATA AND COUNTER MACHINES OVER BOUNDED LANGUAGES
- scientific article; zbMATH DE number 512842
- Counter machines and verification problems.
- scientific article; zbMATH DE number 1759429
Cited in
(44)- An analysis of the nonemptiness problem for classes of reversal-bounded multicounter machines
- Generalized discrete timed automata: Decidable approximations for safety verification.
- Pushdown timed automata: A binary reachability characterization and safety verification.
- Accepting runs in a two-way finite automaton
- On two-way nondeterministic finite automata with one reversal-bounded counter
- On store languages of language acceptors
- A technique for proving decidability of containment and equivalence of linear constraint queries
- Counter machines and verification problems.
- Some decision problems concerning semilinearity and commutation.
- On two-way FA with monotonic counters and quadratic Diophantine equations
- Dense-choice counter machines revisited
- On the complexity of decision problems for counter machines with applications to coding theory
- On decision problems for parameterized machines
- On decidability and closure properties of language classes with respect to bio-operations
- On counting functions and slenderness of languages
- On composition and lookahead delegation of \(e\)-services modeled by automata
- The effect of end-markers on counter machines and commutativity
- ON COUNTER MACHINES, REACHABILITY PROBLEMS, AND DIOPHANTINE EQUATIONS
- Two-way counter machines and finite-state transducers†
- scientific article; zbMATH DE number 3974295 (Why is no real title available?)
- On two-way weak counter machines
- Similarity in languages and programs
- scientific article; zbMATH DE number 512842 (Why is no real title available?)
- ON THE EQUIVALENCE OF TWO-WAY PUSHDOWN AUTOMATA AND COUNTER MACHINES OVER BOUNDED LANGUAGES
- On synchronized multi-tape and multi-head automata
- Descriptional complexity of two-way pushdown automata with restricted head reversals
- scientific article; zbMATH DE number 1500528 (Why is no real title available?)
- scientific article; zbMATH DE number 1759429 (Why is no real title available?)
- Model checking flat Freeze LTL on one-counter automata
- New decidability results concerning two-way counter machines and applications
- scientific article; zbMATH DE number 1408336 (Why is no real title available?)
- On Synchronized Multitape and Multihead Automata
- Descriptional complexity of two-way pushdown automata with restricted head reversals
- SOME DECISION QUESTIONS CONCERNING THE TIME COMPLEXITY OF LANGUAGE ACCEPTORS
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- Witness Runs for Counter Machines
- Boundedness problems for Minsky counter machines
- On the complexity of decision problems for some classes of machines and applications
- On decision problems concerning contextual insertions and deletions
- On the containment problem for deterministic multicounter machine models
- On the universe, disjointness, and containment problems for simple machines
- Store languages of Turing machines and counter machines
- Two-way one-counter nets revisited
- On the solvability of a class of Diophantine equations and applications
This page was built for publication: New Decidability Results Concerning Two-Way Counter Machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4326857)
