Lax Lean Archive

Draft — mutable and not usable as a dependency; its citation marks the draft state.

Lax53.Determinization

Determinization of tree automata

concepts/Lax53/Determinization.lean · lax-53

proven

Loading review…

Community review

Flags

Each flag is tied to a public ORCID identity and explains why this concept may be incorrect.

No flags have been submitted.

    Community review

    Flag this concept

    State precisely what appears incorrect. This explanation will be public under your ORCID name.

    No source line selected.

    Concept map

    Proven claimDefinitionThis conceptRelated conceptA → B: B builds on A

    Evidence

    Each proof establishes this claim relative to its assumptions.

    Theorem

    Every bottom-up tree automaton with finitely many states has an equivalent deterministic tree automaton with finitely many states over the same ranked alphabet.

    Lean source view on GitHub

    1import Lax53.RankedTree
    2import Lax53.TreeAutomaton
    3
    4/-!
    5---
    6title: Determinization of tree automata
    7type: theorem
    8---
    9
    10Every bottom-up tree automaton with finitely many states has an equivalent
    11deterministic tree automaton with finitely many states over the same ranked
    12alphabet.
    13-/
    14
    15namespace Lax53.Determinization
    16
    17open Lax53.RankedTree
    18open Lax53.TreeAutomaton
    19
    20universe u v
    21
    22axiom exists_deterministic_equivalent {A : RankedAlphabet.{u}} {Q : Type v}
    23 [Fintype Q] (M : Automaton A Q) :
    24 ∃ Q' : Type v, ∃ _ : Fintype Q', ∃ D : Automaton A Q',
    25 D.Deterministic ∧ D.language = M.language
    26
    27end Lax53.Determinization
    28
    Show Proof

    Builds on

    Used by

    none

    From Mathlib

    none

    Community review

    Discussion

    Ask a question or add context. Endorsements and structured flags are kept in the review panel above; your ORCID profile must share a public name.

    0 comments

    Loading discussion…