Finite Automata and Their Decision Problems

@article{Rabin1959FiniteAA,
  title={Finite Automata and Their Decision Problems},
  author={Michael O. Rabin and Dana S. Scott},
  journal={IBM Journal of Research and Development},
  year={1959},
  volume={3},
  pages={114-125}
}
Finite automata are considered in this paper a s instruments for classifying finite tapes. Each onetape automaton defines a set of tapes, a two-tape automaton defines a set of pairs of tapes, et cetera. The structure of the defined sets is studied. 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… CONTINUE READING
Highly Influential
This paper has highly influenced 70 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 1,472 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.
738 Citations
6 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 738 extracted citations

1,473 Citations

050100'60'76'93'10
Citations per Year
Semantic Scholar estimates that this publication has 1,473 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-6 of 6 references

Linear automaton transformations,

  • A. Nerode
  • Proceedings of the American Mathematical Society,
  • 1958

Gedanken-experiments on sequential machines,

  • E. F. Moore
  • Automata Studies,
  • 1956

Representation of events in nerve nets and finite automata,

  • S. C. Kleene
  • Automata Studies, Princeton, pp. 3-4
  • 1956

A variant of a recursively unsolvable problem,

  • E. Post
  • Bulletin of the American Mathematical Society,
  • 1946

Similar Papers

Loading similar papers…