Lax916827.TwoWayRationalPrecomposition
Two-way transducers are closed under pre-composition with rational functions
concepts/Lax916827/TwoWayRationalPrecomposition.lean · lax-916827
No public endorsements yet.
Loading review…
Sign in with ORCIDConcept map
In the paper
- page 96 of the paper of lax-157538, Transducers
Theorem
Functions computed by two-way transducers are closed under pre-composition with rational functions (Corollary C.2.7 of Transducers). By Theorem B.2.6 a rational function is a composition of prime Mealy machines, their right-to-left variants, homomorphisms and the separator function; Lemma C.2.6 handles the Mealy machines, a right-to-left machine is handled symmetrically, and a homomorphism is handled by simulating the head inside the image of a letter.
Lean source view on GitHub
| 1 | import Lax132576.RationalFunctions |
| 2 | import Lax916827.TwoWayTransducers |
| 3 | |
| 4 | /-! |
| 5 | --- |
| 6 | title: Two-way transducers are closed under pre-composition with rational functions |
| 7 | type: theorem |
| 8 | --- |
| 9 | Functions computed by two-way transducers are closed under pre-composition with |
| 10 | rational functions (Corollary C.2.7 of *Transducers*). By Theorem B.2.6 a |
| 11 | rational function is a composition of prime Mealy machines, their right-to-left |
| 12 | variants, homomorphisms and the separator function; Lemma C.2.6 handles the |
| 13 | Mealy machines, a right-to-left machine is handled symmetrically, and a |
| 14 | homomorphism is handled by simulating the head inside the image of a letter. |
| 15 | |
| 16 | # Formalization notes |
| 17 | |
| 18 | All three alphabets are assumed finite, as in the book. |
| 19 | -/ |
| 20 | |
| 21 | namespace Lax916827.TwoWayRationalPrecomposition |
| 22 | |
| 23 | open Lax132576.RationalFunctions Lax916827.TwoWayTransducers |
| 24 | |
| 25 | /-- Pre-composing a two-way transducer with a rational function gives a two-way |
| 26 | transducer. -/ |
| 27 | axiom isTwoWay_comp_isRationalFun {A B C : Type} [Finite A] [Finite B] [Finite C] |
| 28 | {f : List A → List B} {g : List B → List C} (hf : IsRationalFun f) (hg : IsTwoWay g) : |
| 29 | IsTwoWay (g ∘ f) |
| 30 | |
| 31 | end Lax916827.TwoWayRationalPrecomposition |
| 32 |
Formalization notes
All three alphabets are assumed finite, as in the book.
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