Unambiguous Forest Factorization
Paul Gastin, Shankara Narayanan Krishna

TL;DR
This paper introduces an unambiguous automaton construction for Simon's forest factorization theorem, simplifying proofs and enabling applications in automata theory and transducer synthesis.
Contribution
It constructs a universal unambiguous automaton for a given morphism, providing a simpler proof of the forest factorization theorem and applications in regular transducer expressions.
Findings
Automaton A is universal and unambiguous for the morphism
Provides a Ramsey split with height bounded by automaton states
Enables construction of regular transducer expressions from automata
Abstract
In this paper, we look at an unambiguous version of Simon's forest factorization theorem, a very deep result which has wide connections in algebra, logic and automata. Given a morphism from to a finite semigroup , we construct a universal, unambiguous automaton A which is "good" for . The goodness of gives a very easy proof for the forest factorization theorem, providing a Ramsey split for any word in such that the height of the Ramsey split is bounded by the number of states of A. An important application of synthesizing good automata from the morphim is in the construction of regular transducer expressions (RTE) corresponding to deterministic two way transducers.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicssemigroups and automata theory · Logic, programming, and type systems · Natural Language Processing Techniques
