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 8 research declarations. Search 10,000 more complete Mathlib declarations.
8 results
Clear filtersAutomata.acc_lang_loop
Plain-language statement
The language accepted by the loop NA is the Kleene star of the language accepted by M.
Source project: Automata Theory
Person-level attribution pending.
Automata.acc_lang_loop_concat
Plain-language statement
The concatenation of the language accepted by the loop NA with itself is a subset of itself.
Source project: Automata Theory
Person-level attribution pending.
Automata.acc_omega_lang_loop
Plain-language statement
The ω-language accepted by the loop NA is the ω-power of the language accepted by M.
Source project: Automata Theory
Person-level attribution pending.
Automata.na_loop_fin_run
Plain-language statement
A finite run of the loop NA that contains the inl () marker only at the beginning and at the end is an accepting run of M.
Source project: Automata Theory
Person-level attribution pending.
Automata.na_loop_fin_run_exists
Plain-language statement
Conversely, for any finite accepting run of M, there is a finite run of the loop NA that contains the inl () marker only at the beginning and at the end.
Source project: Automata Theory
Person-level attribution pending.
Cslib.Automata.NA.FinAcc.loop_language_eq
Plain-language statement
finLoop na accepts the Kleene star of the language of na, assuming that the latter is nonempty.
Source project: Lean Computer Science Library
Person-level attribution pending.