The family of languages recognized by one-way multihead writing finite automata is investigated. It is shown that there are languages recognized by deterministic three-head one-way nonwriting finite automata that cannot be recognized by any nondeterministic two-head one-way writing finite automaton
AbstractWe investigate the power of (1-reversal) counter machines (finite automata with multiple cou...
AbstractSome remarks on multiple-entry finite automata are presented. They deal with the effects of ...
AbstractA one-way preset Turing machine with base L is a nondeterministic on-line Turing machine wit...
The family of languages recognized by one-way multihead writing finite automata is investigated. It ...
AbstractThe first half of this paper investigates the accepting powers of various types of simple on...
AbstractWe consider one-way non-sensing multihead finite automata. Let Pm={1a1∗1a2∗μ∗1am#1am∗1am−1∗…...
We give characterizations of multihead two-way finite automata in terms of multihead reversal-bounde...
AbstractWe consider one-way multihead automata recognizing 2-bounded languages, i.e., languages L su...
AbstractWe define alternating multihead finite automata, a generalization of nondeterministic multih...
A new family of automata, one-way multihead marker automata, is introduced. Intuitively these device...
A new family of automata, one-way multihead marker automata, is introduced. Intuitively these device...
A parallel communicating automata system consists of several automata working independently in paral...
A parallel communicating automata system consists of several automata working independently in paral...
AbstractWe consider one-way non-sensing multihead finite automata. Let Pm={1a1∗1a2∗μ∗1am#1am∗1am−1∗…...
AbstractAlternating finite automata on ω-words are introduced as an extension of nondeterministic fi...
AbstractWe investigate the power of (1-reversal) counter machines (finite automata with multiple cou...
AbstractSome remarks on multiple-entry finite automata are presented. They deal with the effects of ...
AbstractA one-way preset Turing machine with base L is a nondeterministic on-line Turing machine wit...
The family of languages recognized by one-way multihead writing finite automata is investigated. It ...
AbstractThe first half of this paper investigates the accepting powers of various types of simple on...
AbstractWe consider one-way non-sensing multihead finite automata. Let Pm={1a1∗1a2∗μ∗1am#1am∗1am−1∗…...
We give characterizations of multihead two-way finite automata in terms of multihead reversal-bounde...
AbstractWe consider one-way multihead automata recognizing 2-bounded languages, i.e., languages L su...
AbstractWe define alternating multihead finite automata, a generalization of nondeterministic multih...
A new family of automata, one-way multihead marker automata, is introduced. Intuitively these device...
A new family of automata, one-way multihead marker automata, is introduced. Intuitively these device...
A parallel communicating automata system consists of several automata working independently in paral...
A parallel communicating automata system consists of several automata working independently in paral...
AbstractWe consider one-way non-sensing multihead finite automata. Let Pm={1a1∗1a2∗μ∗1am#1am∗1am−1∗…...
AbstractAlternating finite automata on ω-words are introduced as an extension of nondeterministic fi...
AbstractWe investigate the power of (1-reversal) counter machines (finite automata with multiple cou...
AbstractSome remarks on multiple-entry finite automata are presented. They deal with the effects of ...
AbstractA one-way preset Turing machine with base L is a nondeterministic on-line Turing machine wit...
DOI
Add to ORKG