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 filtersacc_lang_congr
Plain-language statement
The language accepted by c.toDA with a unique accepting state s is exactly the equivalence class of s.
Source project: Automata Theory
Person-level attribution pending.
Automata.acc_lang_concat_e
Plain-language statement
The language of the concatenation NA that is accepted by M0's accepting states is the language accepted by M0.
Source project: Automata Theory
Person-level attribution pending.
Automata.acc_lang_concat_ne
Plain-language statement
The language of the concatenation NA that is accepted by M1's accepting states is the language accepted by M0 concatenated with the language accepted by M1 minus the empty word.
Source project: Automata Theory
Person-level attribution pending.
Automata.acc_lang_inter
Plain-language statement
The language accepted by the product NA is the intersection of the languages accepted by the component automata.
Source project: Automata Theory
Person-level attribution pending.
Automata.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.