* {{cite book |last1=Hopcroft |first1=John E. |author-link1=John Hopcroft |last2=Motwani |first2=Rajeev |author-link2=Rajeev Motwani |last3=Ullman |first3=Jeffrey D. |author-link3=Jeffrey Ullman |title=[[Introduction to Automata Theory, Languages, and Computation]] |edition=2 |publication-place=Boston |url= |access-date= |publisher=[[Addison Wesley]] |year=2001 |isbn=0-201-44124-1 |ref=HMU }}
* {{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
Line 293:
}}
* {{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 }}
* {{cite book | first=Michael | last=Sipser | title=Introduction to the Theory of Computation | publisher=PWS | ___location=Boston | year=1997 | isbn=0-534-94728-X | url-access=registration | url=https://archive.org/details/introductiontoth00sips }}.Section— '''1.1''': "Finite Automata," pp. 31–47. Subsection'''4.1''': "Decidable Languages - Decidable Problems Concerning Regular Languages" of section 4.1: Decidable Languages, pp. 152–155. '''4.4''': DFA can accept only regular language
