Finite Automata and Their Decision Problems
@article{Rabin1959FiniteAA,
title={Finite Automata and Their Decision Problems},
author={M. Rabin and D. Scott},
journal={IBM J. Res. Dev.},
year={1959},
volume={3},
pages={114-125}
}Finite automata are considered in this paper as instruments for classifying finite tapes. [...] Key Method Various generalizations of the notion of an automaton are introduced and their relation to the classical automata is determined. Some decision problems concerning automata are shown to be solvable by effective algorithms; others turn out to be unsolvable by algorithms.Expand Abstract
Topics from this paper
1,761 Citations
Simple Counter Machines and Number-Theoretic Problems
- Mathematics, Computer Science
- J. Comput. Syst. Sci.
- 1979
- 21
Theories of Automata on omega-Tapes: A Simplified Approach
- Mathematics, Computer Science
- J. Comput. Syst. Sci.
- 1974
- 212
- PDF
Subset construction complexity for homogeneous automata, position automata and ZPC-structures
- Mathematics, Computer Science
- Theor. Comput. Sci.
- 2001
- 17
The Equivalence Problem for n-Tape Finite Automata with Simple Cycles
- Mathematics, Computer Science
- FSTTCS
- 1987
- PDF
Finite Automata, Definable Sets, and Regular Expressions over omega^n-Tapes
- Mathematics, Computer Science
- J. Comput. Syst. Sci.
- 1978
- 55
Descriptional Complexity of Finite Automata: Concepts and Open Problems
- Mathematics, Computer Science
- J. Autom. Lang. Comb.
- 2002
- 44
Equivalence of Infinite Behavior of Finite Automata
- Mathematics, Computer Science
- Theor. Comput. Sci.
- 1984
- 3
Deterministic Input-Reversal and Input-Revolving Finite Automata
- Mathematics, Computer Science
- LATA
- 2008
- 2
References
SHOWING 1-5 OF 5 REFERENCES
The Reduction of Two-Way Automata to One-Way Automata
- Mathematics, Computer Science
- IBM J. Res. Dev.
- 1959
- 279