Keywords
Büchi automatonDeterministic automatonTwo-way deterministic finite automatonAutomatonDeterministic finite automatonComputer scienceFinite-state machineProbabilistic automatonNondeterministic finite automatonMathematicsAlgebra over a fieldTheoretical computer scienceProgramming languagePure mathematicsAutomata theory
Affiliated Institutions
Related Publications
Theorems on factorization and primality testing
1. Introduction . This paper is concerned with the problem of obtaining theoretical estimates for the number of arithmetical operations required to factorize a large integer n o...
Oracle Quantum Computing
Abstract Building on the work of Deutsch and Jozsa, we construct oracles relative to which (1) there is a decision problem that can be solved with certainty in worst-case polyno...
Handbook of Discrete and Combinatorial Mathematics
Foundations. Counting Methods. Sequences. Number Theory. Algebraic Structures. Linear Algebra. Discrete Probability. Graph Theory. Trees. Networks and Flows. Partially Ordered S...
Publication Info
- Year
- 1966
- Type
- article
- Volume
- 9
- Issue
- 5
- Pages
- 521-530
- Citations
- 477
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
477
OpenAlex
26
Influential
362
CrossRef
Cite This
Robert McNaughton
(1966).
Testing and generating infinite sequences by a finite automaton.
Information and Control
, 9
(5)
, 521-530.
https://doi.org/10.1016/s0019-9958(66)80013-x
Identifiers
- DOI
- 10.1016/s0019-9958(66)80013-x