DOIAbstract
AbstractThe theory given by Rabin and Scott for one-tape finite automata is extended to cover machines with several input tapes which can be advanced independently under finite-state control
AbstractThe theory given by Rabin and Scott for one-tape finite automata is extended to cover machines with several input tapes which can be advanced independently under finite-state control
This paper considers multi-tape and multi-head extensions of various models of pushdown automata. On...
International audienceIn this article we consider two-way two-tape (alternating) automata accepting ...
The principal result described in this paper is the equivalence of the following statements:o(1)Ever...
AbstractThe theory given by Rabin and Scott for one-tape finite automata is extended to cover machin...
This paper summarizes the fundamental expressiveness, closure, and decid-ability properties of vario...
AbstractThe model of multitape finite automaton is generalized by allowing the automaton to rewind a...
Abstract: Finite automata are considered in this paper as instruments for classifying finite tapes. ...
It is well-known that one-tape Turing machines working in linear time are no more powerful than fini...
Using a combinatorial lemma on regular sets, and a technique of attaching a control unit to a parall...
When their reading heads are allowed to move completely asynchronously, finite-state automata with m...
AbstractThe first half of this paper investigates the accepting powers of various types of simple on...
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 ...
In this paper we study languages accepted by nondeterministic $\log n$-tape automata which scan the...
AbstractEilenberg, Elgot and Shepherdson showed in 1969, [S. Eilenberg, C.C. Elgot, J.C. Shepherdson...
This paper considers multi-tape and multi-head extensions of various models of pushdown automata. On...
International audienceIn this article we consider two-way two-tape (alternating) automata accepting ...
The principal result described in this paper is the equivalence of the following statements:o(1)Ever...
AbstractThe theory given by Rabin and Scott for one-tape finite automata is extended to cover machin...
This paper summarizes the fundamental expressiveness, closure, and decid-ability properties of vario...
AbstractThe model of multitape finite automaton is generalized by allowing the automaton to rewind a...
Abstract: Finite automata are considered in this paper as instruments for classifying finite tapes. ...
It is well-known that one-tape Turing machines working in linear time are no more powerful than fini...
Using a combinatorial lemma on regular sets, and a technique of attaching a control unit to a parall...
When their reading heads are allowed to move completely asynchronously, finite-state automata with m...
AbstractThe first half of this paper investigates the accepting powers of various types of simple on...
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 ...
In this paper we study languages accepted by nondeterministic $\log n$-tape automata which scan the...
AbstractEilenberg, Elgot and Shepherdson showed in 1969, [S. Eilenberg, C.C. Elgot, J.C. Shepherdson...
This paper considers multi-tape and multi-head extensions of various models of pushdown automata. On...
International audienceIn this article we consider two-way two-tape (alternating) automata accepting ...
The principal result described in this paper is the equivalence of the following statements:o(1)Ever...
Add to ORKG