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 filtersAutomata.da_acc_lang_compl
Plain-language statement
For a DA, complementing the language it accepts can be achieved by simply complementing the set of accepting states.
Source project: Automata Theory
Person-level attribution pending.
Automata.da_acc_lang_iff_run_acc
Plain-language statement
A finite word al is accepted by M if and only if M reaches an accepting state after running on al starting from the initial state.
Source project: Automata Theory
Person-level attribution pending.
Automata.da_acc_omega_lang
Plain-language statement
The ω-language accepted by a deterministic Buchi automaton is the ω-limit of the language accepted by the same automaton.
Source project: Automata Theory
Person-level attribution pending.
Automata.det_muller_accept_boolean_form
Plain-language statement
The ω-language accepted by a deterministic Muller automaton is a boolean combination of the ω-limits of accepted languages. Note that this result does not need to assume that the automaton is finite-state.
Source project: Automata Theory
Person-level attribution pending.
Automata.det_muller_accept_omega_limit
Plain-language statement
The ω-limit of the language accepted by a deterministic automaton is accepted by a deterministic Muller automaton.
Source project: Automata Theory
Person-level attribution pending.