Add to ORKGThis paper summarizes the fundamental expressiveness, closure, and decid-ability properties of various finite-state automata classes with multiple input tapes. It also includes an original algorithm for the intersection of one-way nondetermin-istic finite-state automata. 1 ar X i
The purpose of this paper is to investigate the computational complexities of deterministic multista...
Every nondeterministic finite-state automaton is equivalent to a deterministic finite-state automato...
Using a combinatorial lemma on regular sets, and a technique of attaching a control unit to a parall...
This paper summarizes the fundamental expressiveness, closure, and decid-ability properties of vario...
When their reading heads are allowed to move completely asynchronously, finite-state automata with m...
Abstract: Finite automata are considered in this paper as instruments for classifying finite tapes. ...
AbstractThe theory given by Rabin and Scott for one-tape finite automata is extended to cover machin...
AbstractThe model of multitape finite automaton is generalized by allowing the automaton to rewind a...
AbstractThe first half of this paper investigates the accepting powers of various types of simple on...
AbstractSome remarks on multiple-entry finite automata are presented. They deal with the effects of ...
The principal result described in this paper is the equivalence of the following statements:o(1)Ever...
This paper considers multi-tape and multi-head extensions of various models of pushdown automata. On...
AbstractThe theory of finite automata and regular expressions over a finite alphabet Σ is here gener...
The decidability of determining equivalence of deterministic multitape automata (or transducers) was...
In this paper we study languages accepted by nondeterministic $\log n$-tape automata which scan the...
The purpose of this paper is to investigate the computational complexities of deterministic multista...
Every nondeterministic finite-state automaton is equivalent to a deterministic finite-state automato...
Using a combinatorial lemma on regular sets, and a technique of attaching a control unit to a parall...
This paper summarizes the fundamental expressiveness, closure, and decid-ability properties of vario...
When their reading heads are allowed to move completely asynchronously, finite-state automata with m...
Abstract: Finite automata are considered in this paper as instruments for classifying finite tapes. ...
AbstractThe theory given by Rabin and Scott for one-tape finite automata is extended to cover machin...
AbstractThe model of multitape finite automaton is generalized by allowing the automaton to rewind a...
AbstractThe first half of this paper investigates the accepting powers of various types of simple on...
AbstractSome remarks on multiple-entry finite automata are presented. They deal with the effects of ...
The principal result described in this paper is the equivalence of the following statements:o(1)Ever...
This paper considers multi-tape and multi-head extensions of various models of pushdown automata. On...
AbstractThe theory of finite automata and regular expressions over a finite alphabet Σ is here gener...
The decidability of determining equivalence of deterministic multitape automata (or transducers) was...
In this paper we study languages accepted by nondeterministic $\log n$-tape automata which scan the...
The purpose of this paper is to investigate the computational complexities of deterministic multista...
Every nondeterministic finite-state automaton is equivalent to a deterministic finite-state automato...
Using a combinatorial lemma on regular sets, and a technique of attaching a control unit to a parall...