Fin Concat language eq
Cslib.Automata.NA.FinAcc.finConcat_language_eq
Plain-language statement
finConcat na1 na2 accepts the concatenation of the languages of na1 and na2.
Exact Lean statement
theorem finConcat_language_eq [Inhabited Symbol] :
language (FinAcc.mk (finConcat na1 na2) (inr '' (some '' na2.accept))) =
language na1 * language na2Formal artifact
Lean source
theorem finConcat_language_eq [Inhabited Symbol] : language (FinAcc.mk (finConcat na1 na2) (inr '' (some '' na2.accept))) = language na1 * language na2 := by ext xl constructor · rintro ⟨s, _, t, h_acc, h_mtr⟩ obtain ⟨xs, ss, h_ωtr, rfl, rfl⟩ := LTS.Total.extend_omegaExecution h_mtr have hc : (finConcat na1 na2).Run (xl ++ω xs) ss := by grind [Run] have hr : (ss xl.length).isRight := by grind obtain ⟨n, _, _, ss2, h_run2, _⟩ := concat_run_proj hc hr refine ⟨xl.take n, ?_, xl.drop n, ?_, ?_⟩ · grind [totalize_language_eq, take_append_of_le_length] · have : ss xl.length = (ss.drop n) (xl.length - n) := by grind- Project
- Lean Computer Science Library
- License
- Apache-2.0
- Commit
- f36649cff2c9
- Source
- Cslib/Computability/Automata/NA/Concat.lean:160-172
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
Unique minimal
Cslib.Automata.DA.FinAcc.unique_minimal
Plain-language statement
The minimal DFA M accepting the language l is unique up to unique isomorphism.
Source project: Lean Computer Science Library
Person-level attribution pending.
Buchi Family cover
Cslib.Automata.NA.Buchi.buchiFamily_cover
Project documentation
na.buchiFamily is a cover if na has only finitely many states. This theorem uses the Ramsey theorem for infinite graphs and does not depend on any details of na.BuchiCongruence other than that it is of finite index.
Source project: Lean Computer Science Library
Person-level attribution pending.
Buchi Family saturation
Cslib.Automata.NA.Buchi.buchiFamily_saturation
Plain-language statement
na.buchiFamily saturates the ω-language accepted by na.
Source project: Lean Computer Science Library
Person-level attribution pending.