Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Automata theory
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
==Further reading== * {{Hopcroft, Motwani, and Ullman 2006}} * {{Sipser 1997}} Part One: Automata and Languages, chapters 1β2, pp. 29β122. Section 4.1: Decidable Languages, pp. 152β159. Section 5.1: Undecidable Problems from Language Theory, pp. 172β183. * {{cite book|author = [[Elaine Rich]] | year = 2008| title = Automata, Computability and Complexity: Theory and Applications | publisher = Pearson | isbn = 978-0-13-228806-4| title-link = Automata, Computability and Complexity: Theory and Applications}} * {{cite book | zbl=0565.68046 | last=Salomaa | first=Arto | author-link=Arto Salomaa | title=Computation and automata | series=Encyclopedia of Mathematics and Its Applications | volume=25 | publisher=[[Cambridge University Press]] | year=1985 | isbn=978-0-521-30245-6 | url-access=registration | url=https://archive.org/details/computationautom0000salo }} * {{cite book | last=Anderson | first=James A. | title=Automata theory with modern applications | others=With contributions by Tom Head | location=Cambridge | publisher=[[Cambridge University Press]] | year=2006 | isbn=978-0-521-61324-8 | zbl=1127.68049 }} * {{cite book | last=Conway | first=J.H. | author-link=John Horton Conway | title=Regular algebra and finite machines | series=Chapman and Hall Mathematics Series | location=London | publisher=[[Chapman & Hall]] | year=1971 | zbl=0231.94041 }} * [[John M. Howie]] (1991) ''Automata and Languages'', [[Clarendon Press]] {{ISBN|0-19-853424-8}} {{mr|id=1254435}} * {{cite book | last=Sakarovitch | first=Jacques | title=Elements of automata theory | others=Translated from the French by Reuben Thomas | publisher=[[Cambridge University Press]] | year=2009 | isbn=978-0-521-84425-3 | zbl=1188.68177 }} * {{cite book |author=[[James P. Schmeiser]] |author2=[[David T. Barnard]] | year = 1995 | title = Producing a top-down parse order with bottom-up parsing | publisher = Elsevier North-Holland}} * {{cite book |author=[[Igor Aleksander]] |author2=F. Keith Hanna | year = 1975 | title = Automata Theory: An Engineering Approach | publisher = Crane Russak | location=New York | isbn = 978-0-8448-0657-0}} * {{cite book|author = [[Marvin Minsky]] | year = 1967 | title = Computation: Finite and infinite machines |url = https://archive.org/details/computationfinit0000mins |url-access = registration | publisher = Prentice Hall | location=Princeton, N.J.}} * {{cite book|author = John C. Martin | year = 2011 | title = Introduction to Languages and The Theory of Computation | publisher = McGraw Hill | location= New York| isbn = 978-0-07-319146-1}}
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)