Myhill–Nerode theorem

#	Item
1	Lecture notes on automata, languages, and grammars Cristopher Moore January 11, 2013 Abstract These lecture notes are intended as a supplement to Moore and Mertens’ The Nature of Computation, and are available to anyon Add to Reading List Source URL: tuvalu.santafe.edu Language: English - Date: 2013-01-11 13:28:25 Applied mathematics Nondeterministic finite automaton Myhill–Nerode theorem DFA minimization Regular language Deterministic finite automaton Regular expression Finite-state machine Powerset construction Automata theory Theoretical computer science Computer science
2	PDF Document Add to Reading List Source URL: engineering.dartmouth.edu Language: English - Date: 2008-04-07 10:58:34 Applied mathematics DFA minimization Myhill–Nerode theorem Nondeterministic finite automaton Regular language Complementation of Büchi automaton Büchi automaton Automata theory Theoretical computer science Computer science
3	PDF Document Add to Reading List Source URL: www.cse.buffalo.edu Language: English - Date: 2010-02-03 14:40:55 Pumping lemma for regular languages Regular language Constructible universe John Myhill Presentation of a group Anil Nerode Formal languages Mathematics Myhill–Nerode theorem