Editing Deterministic finite automaton (section)

==References==
* {{Hopcroft and Ullman 1979|author-link=no|title-link=no}}{{sfn whitelist|CITEREFHopcroftUllman1979}}
* {{Hopcroft, Motwani, and Ullman 2006}}{{sfn whitelist|CITEREFHopcroftMotwaniUllman2006}}
* {{cite book | last=Lawson | first=Mark V. | title=Finite automata | publisher=Chapman and Hall/CRC | year=2004 | isbn=1-58488-255-7 | zbl=1086.68074 }}
* {{cite journal
|last1= McCulloch
|first1= W. S.
|last2= Pitts
|first2= W.
|title= A Logical Calculus of the Ideas Immanent in Nervous Activity
|journal= Bulletin of Mathematical Biophysics
|year= 1943
|volume= 5
|issue= 4
|pages= 115–133
|doi= 10.1007/BF02478259
|pmid= 2185863
}}
* {{cite journal
|last1= Rabin 
|first1= M. O.
|last2= Scott
|first2= D.
|title= Finite automata and their decision problems.
|journal= IBM J. Res. Dev.
|volume= 3
|issue= 2
|year= 1959
|pages= 114–125
|url=https://www.researchgate.net/publication/230876408|doi= 10.1147/rd.32.0114
}}
* {{cite book | last=Sakarovitch | first=Jacques | title=Elements of automata theory | others=Translated from the French by Reuben Thomas | location=Cambridge | publisher=[[Cambridge University Press]] | year=2009 | isbn=978-0-521-84425-3 | zbl=1188.68177 }}
===Further reading===
* {{Sipser 1997}} — '''1.1''': "Finite Automata" pp.&nbsp;31&ndash;47. '''4.1''': "Decidable Languages - Decidable Problems Concerning Regular Languages"  pp.&nbsp;152&ndash;155. '''4.4''': DFA can accept only regular language

{{Formal languages and grammars|state=collapsed}}

{{DEFAULTSORT:Deterministic Finite-State Machine}}
[[Category:Finite-state machines]]