Lax916827.DuplicationContinuous
String duplication is continuous
concepts/Lax916827/DuplicationContinuous.lean · lax-916827
No public endorsements yet.
Loading review…
Sign in with ORCIDConcept map
In the paper
- page 86 of the paper of lax-157538, Transducers
Theorem
String duplication is continuous (Lemma C.1.2 of Transducers, second half): the inverse image of a regular language is the union, over the states of an automaton for , of the strings that lead from an initial state to and from to an accepting state.
Lean source view on GitHub
| 1 | import Lax765601.Continuity |
| 2 | |
| 3 | /-! |
| 4 | --- |
| 5 | title: String duplication is continuous |
| 6 | type: theorem |
| 7 | --- |
| 8 | String duplication is continuous (Lemma C.1.2 of *Transducers*, |
| 9 | second half): the inverse image of a regular language is the union, over |
| 10 | the states of an automaton for , of the strings that lead from an initial |
| 11 | state to and from to an accepting state. |
| 12 | |
| 13 | # Formalization notes |
| 14 | |
| 15 | The alphabet is assumed finite, as in the book. |
| 16 | -/ |
| 17 | |
| 18 | namespace Lax916827.DuplicationContinuous |
| 19 | |
| 20 | open Lax765601.Continuity |
| 21 | |
| 22 | /-- String duplication is continuous. -/ |
| 23 | axiom continuous_duplicate {A : Type} [Finite A] : Continuous (fun w : List A => w ++ w) |
| 24 | |
| 25 | end Lax916827.DuplicationContinuous |
| 26 |
Formalization notes
The alphabet is 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