Add to ORKGWe introduce and investigate Nondeterministically Bounded Modulo Counter Automata (NBMCA), which are two-way one-head automata that comprise a constant number of modulo counters, where the counter bounds are nondeterministically guessed, and this is the only element of nondeterminism. NBMCA are tailored to recognising those languages that are characterised by the existence of a specific factorisation of their words, e. g., pattern languages. In this work, we subject NBMCA to a theoretically sound analysis
AbstractThe class of deterministic two-way finite automata augmented by reversal-bounded counters op...
We study finite automata with both nondeterministic and random states (npfa's). We restrict our...
AbstractFor classes of languages accepted in polynomial time by multicounter machines, various trade...
We introduce and investigate Nondeterministically Bounded Modulo Counter Automata (NBMCA), which are...
summary:We introduce and investigate Nondeterministically Bounded Modulo Counter Automata (NBMCA), w...
In this work, we consider deterministic two-way multi-headautomata, the input heads of which are non...
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 ...
AbstractThis work is concerned with simulating nondeterministic one-reversal multicounter automata (...
Counting abilities in finite automata are traditionally provided by two orthogonal extensions: addin...
Counter automata are more powerful versions of finite state automata where addition and subtraction ...
AbstractThis work is concerned with 1-way multihead finite automata (FA), both deterministic and non...
We show that the emptiness problem for two-way nondeterministic finite automata augmented with one r...
AbstractThe main result of this paper is that two-way nondeterministic counter automata are better t...
Abstract We consider stateless counter machines which mix the features of one-head counter machines ...
AbstractThe class of deterministic two-way finite automata augmented by reversal-bounded counters op...
We study finite automata with both nondeterministic and random states (npfa's). We restrict our...
AbstractFor classes of languages accepted in polynomial time by multicounter machines, various trade...
We introduce and investigate Nondeterministically Bounded Modulo Counter Automata (NBMCA), which are...
summary:We introduce and investigate Nondeterministically Bounded Modulo Counter Automata (NBMCA), w...
In this work, we consider deterministic two-way multi-headautomata, the input heads of which are non...
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 ...
AbstractThis work is concerned with simulating nondeterministic one-reversal multicounter automata (...
Counting abilities in finite automata are traditionally provided by two orthogonal extensions: addin...
Counter automata are more powerful versions of finite state automata where addition and subtraction ...
AbstractThis work is concerned with 1-way multihead finite automata (FA), both deterministic and non...
We show that the emptiness problem for two-way nondeterministic finite automata augmented with one r...
AbstractThe main result of this paper is that two-way nondeterministic counter automata are better t...
Abstract We consider stateless counter machines which mix the features of one-head counter machines ...
AbstractThe class of deterministic two-way finite automata augmented by reversal-bounded counters op...
We study finite automata with both nondeterministic and random states (npfa's). We restrict our...
AbstractFor classes of languages accepted in polynomial time by multicounter machines, various trade...