Characterizing classes of regular languages using prefix codes of bounded synchronization delay
Volker Diekert, Tobias Walter

TL;DR
This paper characterizes classes of regular languages using prefix codes with bounded synchronization delay, linking their syntactic monoids to subgroup varieties, and introduces local Rees products for monoid decomposition.
Contribution
It extends Schützenberger's work to all subgroup varieties H, providing a new monoid decomposition method using local Rees products and addressing open questions about Rees product closure.
Findings
Languages in SD_H(A^∞) have syntactic monoids with all subgroups in H.
The method applies directly to finite and infinite words.
Decomposition uses a singly exponential number of operations.
Abstract
In this paper we continue a classical work of Sch\"utzenberger on codes with bounded synchronization delay. He was interested to characterize those regular languages where the groups in the syntactic monoid belong to a variety . He allowed operations on the language side which are union, intersection, concatenation and modified Kleene-star involving a mapping of a prefix code of bounded synchronization delay to a group , but no complementation. In our notation this leads to the language classes and ). Our main result shows that always corresponds to the languages having syntactic monoids where all subgroups are in . Sch\"utzenberger showed this for a variety if contains Abelian groups, only. Our method shows the general result for all directly on finite and infinite words. Furthermore, we introduce the notion of…
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.
