RegularLanguage
📁 Source: Cslib/Computability/Languages/RegularLanguage.lean
Statistics
| Metric | Count |
|---|---|
| Definitions | 0 |
| 13 | |
| Total | 13 |
Cslib.Language.IsRegular
Theorems
| Name | Kind | Assumes | Proves | Validates | Depends On |
|---|---|---|---|---|---|
add 📖 | — | — | — | — | iff_dfa |
compl 📖 | — | — | — | — | iff_dfa |
congr_fin_index 📖 | mathematical | — | Cslib.RightCongruence.eqvCls | — | iff_dfaCslib.Automata.DA.FinAcc.congr_language_eq |
iInf 📖 | — | — | — | — | — |
iSup 📖 | — | — | — | — | zeroadd |
iff_dfa 📖 | mathematical | — | Cslib.Automata.Acceptor.languageCslib.Automata.DA.FinAccCslib.Automata.DA.FinAcc.instAcceptor | — | — |
iff_nfa 📖 | mathematical | — | Cslib.Automata.Acceptor.languageCslib.Automata.NA.FinAccCslib.Automata.NA.FinAcc.instAcceptor | — | iff_dfa |
inf 📖 | — | — | — | — | iff_dfa |
kstar 📖 | — | — | — | — | iff_nfaCslib.Automata.NA.FinAcc.loop_language_eq |
mul 📖 | — | — | — | — | iff_nfaCslib.Automata.NA.FinAcc.finConcat_language_eq |
one 📖 | — | — | — | — | iff_dfa |
top 📖 | — | — | — | — | complzero |
zero 📖 | — | — | — | — | iff_dfa |
---