Publication date
April 1973
DOI Publisher
Published by Elsevier Inc. ISSN
0022-0000Abstract
A decision procedure is described for equivalence of deterministic two-tape (one-way) automata
A decision procedure is described for equivalence of deterministic two-tape (one-way) automata
This paper summarizes the fundamental expressiveness, closure, and decid-ability properties of vario...
In this paper we study languages accepted by nondeterministic $\log n$-tape automata which scan the...
AbstractThis note supplements a result of Inoue and Takanami (1980) who showed that for any function...
A decision procedure is described for equivalence of deterministic two-tape (one-way) automata
AbstractBoundary points between decidability and undecidability of various decision questions concer...
International audienceIn this article we consider two-way two-tape (alternating) automata accepting ...
Abstract. The decidability of determining equivalence of deterministic multitape automata was a long...
Abstract: Finite automata are considered in this paper as instruments for classifying finite tapes. ...
The purpose of this paper is to investigate the computational complexities of deterministic multista...
It is proved that there is an algorithm for deciding whether two deterministic stateless pushdown au...
The equivalence problem for deterministic one-counter automata is shown to bedecidable. A corollary ...
This paper shows that it is decidable whether or not two deterministic pushdownautomata, one of whic...
AbstractValiant has shown that the equivalence problem for deterministic finite turn pushdown machin...
The principal result described in this paper is the equivalence of the following statements:o(1)Ever...
AbstractThis article considers the equivalence problem of multitape automata with multidimensional t...
This paper summarizes the fundamental expressiveness, closure, and decid-ability properties of vario...
In this paper we study languages accepted by nondeterministic $\log n$-tape automata which scan the...
AbstractThis note supplements a result of Inoue and Takanami (1980) who showed that for any function...
A decision procedure is described for equivalence of deterministic two-tape (one-way) automata
AbstractBoundary points between decidability and undecidability of various decision questions concer...
International audienceIn this article we consider two-way two-tape (alternating) automata accepting ...
Abstract. The decidability of determining equivalence of deterministic multitape automata was a long...
Abstract: Finite automata are considered in this paper as instruments for classifying finite tapes. ...
The purpose of this paper is to investigate the computational complexities of deterministic multista...
It is proved that there is an algorithm for deciding whether two deterministic stateless pushdown au...
The equivalence problem for deterministic one-counter automata is shown to bedecidable. A corollary ...
This paper shows that it is decidable whether or not two deterministic pushdownautomata, one of whic...
AbstractValiant has shown that the equivalence problem for deterministic finite turn pushdown machin...
The principal result described in this paper is the equivalence of the following statements:o(1)Ever...
AbstractThis article considers the equivalence problem of multitape automata with multidimensional t...
This paper summarizes the fundamental expressiveness, closure, and decid-ability properties of vario...
In this paper we study languages accepted by nondeterministic $\log n$-tape automata which scan the...
AbstractThis note supplements a result of Inoue and Takanami (1980) who showed that for any function...
Add to ORKG