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 63 research declarations. Search 10,000 more complete Mathlib declarations.
63 results
Clear filtersomega_reg_lang_iff_finite_union_form
Plain-language statement
An ω-language is ω-regular if and only if it is the finite union of sets of the form U * V^ω, where all Us and Vs are regular languages.
Source project: Automata Theory
Person-level attribution pending.
omega_reg_lang_imp_det_muller_lang
Plain-language statement
Every deterministic Muller language is an ω-regular language.
Source project: Automata Theory
Person-level attribution pending.
omega_reg_lang_inter
Plain-language statement
ω-regular languages are closed under intersection.
Source project: Automata Theory
Person-level attribution pending.
omega_reg_lang_union
Plain-language statement
ω-regular languages are closed under union.
Source project: Automata Theory
Person-level attribution pending.
reg_lang_concat_e
Project documentation
Helper lemma for reg_lang_concat below.
Source project: Automata Theory
Person-level attribution pending.
reg_lang_concat_ne
Project documentation
Helper lemma for reg_lang_concat below.
Source project: Automata Theory
Person-level attribution pending.