<--- Back to Details
First PageDocument Content
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
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

Add to Reading List

Source URL: engineering.dartmouth.edu

Download Document from Source Website

File Size: 58,23 KB

Share Document on Facebook

Similar Documents

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

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

DocID: dp8c - View Document

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

PDF Document

DocID: 1z2U - View Document

Pumping lemma for regular languages / Regular language / Constructible universe / John Myhill / Presentation of a group / Anil Nerode / Formal languages / Mathematics / Myhill–Nerode theorem

PDF Document

DocID: 1770 - View Document