Transducers, Part D: Polyregular Functions
No public endorsements yet.
Loading review…
Sign in with ORCIDAbstract
Part D of the book Transducers (M. Bojańczyk) as concepts and proofs: the polyregular functions, the top of the transducer ladder, with their two machine models. The Lean development is Aristotle's formalisation of the book, re-presented in the archive's form; it requires the submissions for Parts A and C §1–3 (concepts) and for Part C §4 (proofs).
The definition-concepts are marked squaring, the polyregular functions as compositions of regular functions and marked squaring (D.0.1), for-transducers with their prenex form (D.1.2), pebble transducers, the string representation of pairs of pebble configurations with balanced runs, and the children of a configuration with the string representation of child configuration graphs.
The theorem-concepts are continuity of polyregular functions (D.0.2), the equivalence of for-transducers with polyregular functions (D.1.1, as two implications and their conjunction), the prenex normal form (D.1.3), closure of for-transducers under composition (D.1.4), continuity of pebble transducers (D.2.1), the regularity of reachability and of balanced reachability between configurations (D.2.2, D.2.3, stated as regular languages of encodings rather than as mso formulas), the equivalence of pebble transducers with for-transducers (D.2.4, split), and the three results on the children of a configuration (D.2.5–D.2.7). All are proved. The exercises are not part of this submission.
In the paper
- page 151 of the paper of lax-157538, Transducers
Concepts
- thm✓
Lax194892.BalancedRunReachability - def
Lax194892.ChildConfigurationGraphs - thm✓
Lax194892.ChildGraphOfConfiguration - thm✓
Lax194892.ChildrenOfChildGraph - thm✓
Lax194892.ChildrenOfConfiguration - thm✓
Lax194892.ForComposition - thm✓
Lax194892.ForIffPolyregular - thm✓
Lax194892.ForOfPebble - thm✓
Lax194892.ForOfPolyregular - def
Lax194892.ForTransducers - def
Lax194892.MarkedSquaring - def
Lax194892.PebbleConfigurationEncoding - thm✓
Lax194892.PebbleContinuity - thm✓
Lax194892.PebbleIffFor - thm✓
Lax194892.PebbleOfFor - thm✓
Lax194892.PebbleReachability - def
Lax194892.PebbleTransducers - thm✓
Lax194892.PolyregularContinuity - def
Lax194892.PolyregularFunctions - thm✓
Lax194892.PolyregularOfFor - thm✓
Lax194892.PrenexNormalForm
- def
Lax132576.LabelledAutomata - def
Lax132576.RationalFunctions - def
Lax132576.RationalRelations - def
Lax765601.CompositionClosure - def
Lax765601.Continuity - def
Lax765601.MapLifting - def
Lax916827.RegularFunctions
Concept map
Proofs
Proof networkview on GitHub
-
⊢
Lax194892Proofs.Results.isForTransducer_of_isPebbleTransducer -
⊢
Lax194892Proofs.Results.isPebbleTransducer_iff_isForTransducer -
⊢
Lax194892Proofs.Results.isPebbleTransducer_of_isForTransducer
Lean sources for these proofs: proofs/ on GitHub
Proof code is not displayed; the archive records each proof's checked relationship between claims.
Related submissions
Submission map
Cite this
@misc{lax-194892,
author = {Mikołaj Bojańczyk and Aristotle (Harmonic)},
title = {Transducers, Part D: Polyregular Functions},
year = {2026},
howpublished = {Lax Archive, lax-194892},
url = {https://laxarchive.org/lax-194892/},
note = {draft},
}
References
- Mikołaj Bojańczyk. Polyregular Functions. 2018. arXiv:1810.08760
- Tova Milo, Dan Suciu and Victor Vianu. Typechecking for XML Transformers. Journal of Computer and System Sciences 66(1):66–97, 2003. doi:10.1016/S0022-0000(02)00030-2
- Joost Engelfriet and Sebastian Maneth. Two-Way Finite State Transducers with Nested Pebbles. Mathematical Foundations of Computer Science (MFCS 2002), Lecture Notes in Computer Science 2420:234–244, 2002. doi:10.1007/3-540-45687-2_19
- Mikołaj Bojańczyk. Transducers. 2026. Book in preparation; sources at r̆lhttps://github.com/bojanczyk/transducer-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