Revision as of 20:02, 28 November 2024 edit Pink Bee (talk \| contribs) Extended confirmed users, IP block exemptions 2,142 edits m wording ← Previous edit		Revision as of 21:30, 28 November 2024 edit undo Tule-hog (talk \| contribs) Extended confirmed users 6,834 edits →References: update ref Next edit →
Line 263: * M. O. Rabin and D. Scott, "Finite Automata and their Decision Problems", ''IBM Journal of Research and Development'', '''3''':2 (1959) pp. 115–125. * Michael Sipser, ''Introduction to the Theory of Computation''. PWS, Boston. 1997. {{isbn\|0-534-94728-X}}. ''(see section 1.2: Nondeterminism, pp. 47–63.)'' * {{Hopcroft, Motwani, and Ullman 2006}} ''(See chapter 2, "Finite Automata".)'' * John E. Hopcroft and Jeffrey D. Ullman, ''[[Introduction to Automata Theory, Languages, and Computation]]'', Addison-Wesley Publishing, Reading Massachusetts, 1979. {{isbn\|0-201-02988-X}}. ''(See chapter 2.)'' {{Formal languages and grammars}}

Nondeterministic finite automaton: Difference between revisions