Source-pinned research
Search theorem names, mathematical ideas, modules, topics, projects, and role-labelled researchers. Open a result for its complete indexed Lean declaration and source record.
This index contains 5 research declarations. Search 10,000 more complete Mathlib declarations.
5 results
Clear filtersCslib.ωLanguage.IsRegular.compl
Plain-language statement
The complementation of an ω-regular language is ω-regular.
Source project: Lean Computer Science Library
Person-level attribution pending.
Cslib.ωLanguage.IsRegular.eq_fin_iSup_hmul_omegaPow
Plain-language statement
An ω-language is regular iff it is the finite union of ω-languages of the form L * M^ω, where all Ls and Ms are regular languages.
Source project: Lean Computer Science Library
Person-level attribution pending.
Cslib.ωLanguage.IsRegular.fin_cover_saturates
Plain-language statement
If an ω-language has a finite saturating cover made of ω-regular languages, then it is an ω-regular language.
Source project: Lean Computer Science Library
Person-level attribution pending.
Cslib.ωLanguage.IsRegular.inf
Plain-language statement
The intersection of two ω-regular languages is ω-regular.
Source project: Lean Computer Science Library
Person-level attribution pending.
Cslib.ωLanguage.IsRegular.sup
Plain-language statement
The union of two ω-regular languages is ω-regular.
Source project: Lean Computer Science Library
Person-level attribution pending.