Det muller accept omega limit
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.
Exact Lean statement
theorem det_muller_accept_omega_limit (M : DA A) [Finite M.State] (acc : Set M.State) :
∃ accSet, {as | M.MullerAccept accSet as} = (M.toNA.AcceptedLang acc)↗ωFormal artifact
Lean source
theorem det_muller_accept_omega_limit (M : DA A) [Finite M.State] (acc : Set M.State) : ∃ accSet, {as | M.MullerAccept accSet as} = (M.toNA.AcceptedLang acc)↗ω := by use {acc' | (acc' ∩ acc).Nonempty} ; ext as simp [← da_acc_omega_lang, DA.MullerAccept] ; constructor · rintro ⟨s, h_inf, h_acc⟩ use (M.DetRun as) ; constructor · exact da_inf_run_exists as obtain ⟨φ, h_mono, h_s⟩ := frequently_iff_strict_mono.mp h_inf apply frequently_iff_strict_mono.mpr use φ ; simp [*] · rintro ⟨ss, h_run, h_acc⟩ obtain ⟨rfl⟩ := da_inf_run_unique h_run have : Finite M.toNA.State := by assumption obtain ⟨s, h_s, h_inf⟩ := frequently_in_finite_set.mp h_acc use s ; aesop- Project
- Automata Theory
- License
- Apache-2.0
- Commit
- f196548710ce
- Source
- AutomataTheory/Automata/Det.lean:219-233
Reuse this declaration
Bring the exact result into your workflow
The import identifies the source module. Your project still needs the pinned package dependency shown on this page.
What this badge means
This completion status comes from the project or community source. It has not yet been represented here as an independent rebuild and axiom audit.
Continue in this project
Related declarations
Acc lang congr
acc_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.
Acc lang concat e
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.
Acc lang concat ne
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.