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 10 research declarations. Search 10,000 more complete Mathlib declarations.
10 results
Clear filtersAutomata.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_omega_lang_concat
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.
Source project: Automata Theory
Person-level attribution pending.
Automata.na_concat_fin_run_0
Plain-language statement
A finite run of the concatenation NA that ends in a state of M0 is completely a run of M0.
Source project: Automata Theory
Person-level attribution pending.
Automata.na_concat_fin_run_1
Plain-language statement
A finite run of the concatenation NA that ends in a state of M1 consists of a run of M0 followed by a run of M1.
Source project: Automata Theory
Person-level attribution pending.
Automata.na_concat_inf_run
Plain-language statement
An infinite run of the concatenation NA that contains a state of M1 consists of a finite run of M0 followed by an infinite run of M1.
Source project: Automata Theory
Person-level attribution pending.