Theorems · Definition · computer science
Language.toDFA
{α : Type u} → (L : Language α) → DFA α ↑(Set.range L.leftQuotient)The left quotients of a language are the states of an automaton that accepts the language.
- Defined in
- Mathlib.Computability.MyhillNerode
- Cited by
- 5 results in Mathlib
- Foundations
- Depth 11 from the axioms · uses propext, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites6
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Set.Elemstatement and proof · cited by 7,166
- Set.ofPredproof · cited by 6,101
- Set.rangestatement and proof · cited by 4,705
- Languagestatement and proof · cited by 125
- DFAstatement · cited by 58
- Language.leftQuotientstatement and proof · cited by 12
Cited by5
Results whose statement or proof uses this declaration.
- Language.IsRegular.of_finite_range_leftQuotientproof · cited by 1
- Language.accepts_toDFAstatement and proof · cited by 1
- Language.start_toDFAstatement · cited by 0
- Language.step_toDFAstatement · cited by 0
- Language.mem_accept_toDFAstatement · cited by 0