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

Lax314295.MSOTransductionOfRegular

Regular functions are MSO transductions

concepts/Lax314295/MSOTransductionOfRegular.lean · lax-314295

proven

Loading review…

Sign in with ORCID

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.

    In the paper

    Theorem

    Every regular function is defined by a string-to-string mso transduction (Theorem C.4.8 of Transducers, Engelfriet–Hoogeboom, the implication from regular to transduction). A regular function is computed by a two-way transducer (Theorem C.2.9); the transduction's elements are the pairs of a configuration of its run and an index into the output produced there, and all its formulas — which configurations are reached, which letter is produced, which of two configurations comes first — are regular properties of the input with marked positions, hence mso-definable by Büchi's theorem.

    Lean source view on GitHub

    1import Lax916827.RegularFunctions
    2import Lax314295.MSOTransductions
    3
    4/-!
    5---
    6title: Regular functions are MSO transductions
    7type: theorem
    8---
    9Every regular function is defined by a string-to-string mso transduction
    10(Theorem C.4.8 of *Transducers*, Engelfriet–Hoogeboom, the implication from
    11regular to transduction). A regular function is computed by a two-way
    12transducer (Theorem C.2.9); the transduction's elements are the pairs of a
    13configuration of its run and an index into the output produced there, and all
    14its formulas — which configurations are reached, which letter is produced, which
    15of two configurations comes first — are regular properties of the input with
    16marked positions, hence mso-definable by Büchi's theorem.
    17
    18# Formalization notes
    19
    20Both alphabets are assumed finite, as in the book.
    21-/
    22
    23namespace Lax314295.MSOTransductionOfRegular
    24
    25open Lax916827.RegularFunctions Lax314295.MSOTransductions
    26
    27/-- A regular function is defined by an mso transduction. -/
    28axiom isMSOTransduction_of_isRegularFun {A B : Type} [Finite A] [Finite B]
    29 {f : List A → List B} (hf : IsRegularFun f) : IsMSOTransduction f
    30
    31end Lax314295.MSOTransductionOfRegular
    32
    Show Proof

    Formalization notes

    Both alphabets are assumed finite, as in the book.

    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…