AbstractThe main result of this paper is that two-way nondeterministic counter automata are better than deterministic ones. Also the class of two-way deterministic counter automaton languages is compared with other classes of languages and some nonclosure properties of this class are proved
AbstractWe define a language L and show that it cannot be recognized by any two way deterministic co...
AbstractWe show that the emptiness problem for two-way nondeterministic finite automata augmented wi...
We introduce and investigate Nondeterministically Bounded Modulo Counter Automata (NBMCA), which are...
AbstractThe main result of this paper is that two-way nondeterministic counter automata are better t...
The two main results of the paper are: (1) proving a fine hierarchy of reversal-bounded counter mach...
This paper shows that it is decidable whether or not two deterministic pushdownautomata, one of whic...
AbstractThe class of deterministic two-way finite automata augmented by reversal-bounded counters op...
We consider some of the important unsolved problems in the theory of computation concerning the rel...
We show that the emptiness problem for two-way nondeterministic finite automata augmented with one r...
AbstractWe investigate the power of (1-reversal) counter machines (finite automata with multiple cou...
The equivalence problem for deterministic one-counter automata is shown to bedecidable. A corollary ...
AbstractLet DPDA(k) (respectively NPDA(k)) be the class of languages recognized by one-way k-head de...
It is proved that there is an algorithm for deciding whether two deterministic stateless pushdown au...
AbstractBoundary points between decidability and undecidability of various decision questions concer...
AbstractThe investigation of the computational power of randomized computations is one of the centra...
AbstractWe define a language L and show that it cannot be recognized by any two way deterministic co...
AbstractWe show that the emptiness problem for two-way nondeterministic finite automata augmented wi...
We introduce and investigate Nondeterministically Bounded Modulo Counter Automata (NBMCA), which are...
AbstractThe main result of this paper is that two-way nondeterministic counter automata are better t...
The two main results of the paper are: (1) proving a fine hierarchy of reversal-bounded counter mach...
This paper shows that it is decidable whether or not two deterministic pushdownautomata, one of whic...
AbstractThe class of deterministic two-way finite automata augmented by reversal-bounded counters op...
We consider some of the important unsolved problems in the theory of computation concerning the rel...
We show that the emptiness problem for two-way nondeterministic finite automata augmented with one r...
AbstractWe investigate the power of (1-reversal) counter machines (finite automata with multiple cou...
The equivalence problem for deterministic one-counter automata is shown to bedecidable. A corollary ...
AbstractLet DPDA(k) (respectively NPDA(k)) be the class of languages recognized by one-way k-head de...
It is proved that there is an algorithm for deciding whether two deterministic stateless pushdown au...
AbstractBoundary points between decidability and undecidability of various decision questions concer...
AbstractThe investigation of the computational power of randomized computations is one of the centra...
AbstractWe define a language L and show that it cannot be recognized by any two way deterministic co...
AbstractWe show that the emptiness problem for two-way nondeterministic finite automata augmented wi...
We introduce and investigate Nondeterministically Bounded Modulo Counter Automata (NBMCA), which are...
DOI
Add to ORKG