AbstractThis article considers the equivalence problem of multitape automata with multidimensional tapes, where the motion of the heads is monotone in all directions (no backward motion). It is shown that this problem can be reduced to the equivalence problem of ordinary multitape automata. Some applications of the result are adduced
This paper summarizes the fundamental expressiveness, closure, and decid-ability properties of vario...
AbstractLet DPDA(k) (respectively NPDA(k)) be the class of languages recognized by one-way k-head de...
We prove that two automata with multiplicity in Z are equivalent, i.e. define the same rational seri...
Abstract. The decidability of determining equivalence of deterministic multitape automata was a long...
AbstractThe model of multitape finite automaton is generalized by allowing the automaton to rewind a...
AbstractThe theory given by Rabin and Scott for one-tape finite automata is extended to cover machin...
AbstractA natural and sufficiently large class of deterministic one-way multitape automa is defined ...
The purpose of this paper is to investigate the computational complexities of deterministic multista...
A correspondence is established between N2, the class of sets of pairs of tapes defined by nondeterm...
When their reading heads are allowed to move completely asynchronously, finite-state automata with m...
AbstractWe present a method for size reduction of two-way multitape automata. Our algorithm applies ...
AbstractUsing a result of B.H. Neumann we extend Eilenberg's Equality Theorem to a general result wh...
A decision procedure is described for equivalence of deterministic two-tape (one-way) automata
The principal result described in this paper is the equivalence of the following statements:o(1)Ever...
The purpose of this paper is to propose a new type of acceptor on a two-dimensional tape, called a “...
This paper summarizes the fundamental expressiveness, closure, and decid-ability properties of vario...
AbstractLet DPDA(k) (respectively NPDA(k)) be the class of languages recognized by one-way k-head de...
We prove that two automata with multiplicity in Z are equivalent, i.e. define the same rational seri...
Abstract. The decidability of determining equivalence of deterministic multitape automata was a long...
AbstractThe model of multitape finite automaton is generalized by allowing the automaton to rewind a...
AbstractThe theory given by Rabin and Scott for one-tape finite automata is extended to cover machin...
AbstractA natural and sufficiently large class of deterministic one-way multitape automa is defined ...
The purpose of this paper is to investigate the computational complexities of deterministic multista...
A correspondence is established between N2, the class of sets of pairs of tapes defined by nondeterm...
When their reading heads are allowed to move completely asynchronously, finite-state automata with m...
AbstractWe present a method for size reduction of two-way multitape automata. Our algorithm applies ...
AbstractUsing a result of B.H. Neumann we extend Eilenberg's Equality Theorem to a general result wh...
A decision procedure is described for equivalence of deterministic two-tape (one-way) automata
The principal result described in this paper is the equivalence of the following statements:o(1)Ever...
The purpose of this paper is to propose a new type of acceptor on a two-dimensional tape, called a “...
This paper summarizes the fundamental expressiveness, closure, and decid-ability properties of vario...
AbstractLet DPDA(k) (respectively NPDA(k)) be the class of languages recognized by one-way k-head de...
We prove that two automata with multiplicity in Z are equivalent, i.e. define the same rational seri...