Decidable Languages
Regular operations on decidable Languages
Regular Expressions
Regular Languages
Finite Automata
Deterministic Finite Automata
Nondeterministic Finite Automata.
Equivalence of DFAs and NFAs
Regular Operations on Automata
Translation of Regular Expressions to Finite Automata
Decidability of Language Equivalence
Construction of the Connected Sub-Automaton
DFA Minimization
Computation of the collapsing Relation
Correctness of Minimization
Uniqueness of Minimal DFAs
Kleene's Algorithm
Defining
R
and
L
Correspondence between
L
and
R
A regular expression for the language of a DFA
Closure of Regular Languages under intersection and complement
Myhill-Nerode
Partitions
Conversions between Myhill-Partitions and DFAs
Closure of Regular Languages under Homomorphisms
Closure under Preimages of Homomorphisms
Closure under Images of Homomorphimsms
Provoing Languages Non-Regular
Non-Regularity using Myhill-Nerode
Pumping Lemma
Generic Constructions and Lemmas
A Least Fixpoint Operator for Finite Types
Constructive Quotients
This page has been generated by
coqdoc