Lax916827.TwoWayContinuity
Two-way transducers are continuous
concepts/Lax916827/TwoWayContinuity.lean · lax-916827
No public endorsements yet.
Loading review…
Sign in with ORCIDConcept map
In the paper
- page 92 of the paper of lax-157538, Transducers
Theorem
Every function computed by a two-way transducer is continuous (Theorem C.2.2 of Transducers, Rabin–Scott and Shepherdson). The book computes the reachable configuration graph by a rational function (Lemma C.2.3) and checks membership of the output in a regular language on the representation (Lemma C.2.4); a direct proof runs a deterministic automaton for the output language inside the transducer, turning it into a two-way automaton, whose language is regular by Shepherdson's theorem.
Lean source view on GitHub
| 1 | import Lax765601.Continuity |
| 2 | import Lax916827.TwoWayTransducers |
| 3 | |
| 4 | /-! |
| 5 | --- |
| 6 | title: Two-way transducers are continuous |
| 7 | type: theorem |
| 8 | --- |
| 9 | Every function computed by a two-way transducer is continuous (Theorem C.2.2 of |
| 10 | *Transducers*, Rabin–Scott and Shepherdson). The book computes the reachable |
| 11 | configuration graph by a rational function (Lemma C.2.3) and checks membership |
| 12 | of the output in a regular language on the representation (Lemma C.2.4); a |
| 13 | direct proof runs a deterministic automaton for the output language inside the |
| 14 | transducer, turning it into a two-way automaton, whose language is regular by |
| 15 | Shepherdson's theorem. |
| 16 | |
| 17 | # Formalization notes |
| 18 | |
| 19 | Both alphabets are assumed finite, as in the book. |
| 20 | -/ |
| 21 | |
| 22 | namespace Lax916827.TwoWayContinuity |
| 23 | |
| 24 | open Lax765601.Continuity Lax916827.TwoWayTransducers |
| 25 | |
| 26 | /-- A function computed by a two-way transducer is continuous. -/ |
| 27 | axiom continuous_of_isTwoWay {A B : Type} [Finite A] [Finite B] {f : List A → List B} |
| 28 | (hf : IsTwoWay f) : Continuous f |
| 29 | |
| 30 | end Lax916827.TwoWayContinuity |
| 31 |
Formalization notes
Both 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