Add to ORKGWe introduce and investigate Nondeterministically Bounded Modulo Counter Automata (NBMCA), which are two-way multi-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
AbstractThis work is concerned with 1-way multihead finite automata (FA), both deterministic and non...
AbstractPushdown automata using a limited and unlimited amount of nondeterminism are investigated. M...
International audienceWe propose a new algorithm for checking language equivalence of non-determinis...
We introduce and investigate Nondeterministically Bounded Modulo Counter Automata (NBMCA), which are...
We introduce and investigate Nondeterministically Bounded Modulo Counter Automata (NBMCA), which are...
In this work, we consider deterministic two-way multi-headautomata, the input heads of which are non...
Counter automata are more powerful versions of finite state automata where addition and subtraction ...
AbstractWe investigate the power of (1-reversal) counter machines (finite automata with multiple cou...
AbstractThis work is concerned with simulating nondeterministic one-reversal multicounter automata (...
The equivalence problem for deterministic one-counter automata is shown to bedecidable. A corollary ...
Counting abilities in finite automata are traditionally provided by two orthogonal extensions: addin...
We show that the emptiness problem for two-way nondeterministic finite automata augmented with one r...
AbstractThe amount of nondeterminism that a pushdown automaton requires to recognize an input string...
AbstractThe main result of this paper is that two-way nondeterministic counter automata are better t...
AbstractWe compare the nondeterministic state complexity of unary regular languages and that of thei...
AbstractThis work is concerned with 1-way multihead finite automata (FA), both deterministic and non...
AbstractPushdown automata using a limited and unlimited amount of nondeterminism are investigated. M...
International audienceWe propose a new algorithm for checking language equivalence of non-determinis...
We introduce and investigate Nondeterministically Bounded Modulo Counter Automata (NBMCA), which are...
We introduce and investigate Nondeterministically Bounded Modulo Counter Automata (NBMCA), which are...
In this work, we consider deterministic two-way multi-headautomata, the input heads of which are non...
Counter automata are more powerful versions of finite state automata where addition and subtraction ...
AbstractWe investigate the power of (1-reversal) counter machines (finite automata with multiple cou...
AbstractThis work is concerned with simulating nondeterministic one-reversal multicounter automata (...
The equivalence problem for deterministic one-counter automata is shown to bedecidable. A corollary ...
Counting abilities in finite automata are traditionally provided by two orthogonal extensions: addin...
We show that the emptiness problem for two-way nondeterministic finite automata augmented with one r...
AbstractThe amount of nondeterminism that a pushdown automaton requires to recognize an input string...
AbstractThe main result of this paper is that two-way nondeterministic counter automata are better t...
AbstractWe compare the nondeterministic state complexity of unary regular languages and that of thei...
AbstractThis work is concerned with 1-way multihead finite automata (FA), both deterministic and non...
AbstractPushdown automata using a limited and unlimited amount of nondeterminism are investigated. M...
International audienceWe propose a new algorithm for checking language equivalence of non-determinis...