Measure-Theoretic Aspects of Star-Free and Group Languages
Ryoma Sin'ya, Takao Yuyama

TL;DR
This paper explores measure-theoretic properties of star-free and group languages, establishing equivalences, algebraic characterizations, and independence results that deepen understanding of their structural and probabilistic aspects.
Contribution
It provides a new algebraic characterization of star-free measurable languages and demonstrates the equivalence of measuring power between star-free and generalized definite languages.
Findings
Star-free and generalized definite languages have the same measuring power.
A purely algebraic characterization of SF-measurable regular languages is given.
Star-free and group languages are probabilistically independent.
Abstract
A language is said to be -measurable, where is a class of languages, if there is an infinite sequence of languages in that ``converges'' to . We investigate the properties of -measurability in the cases where is SF, the class of all star-free languages, and G, the class of all group languages. It is shown that a language is SF-measurable if and only if is GD-measurable, where GD is the class of all generalised definite languages (a more restricted subclass of star-free languages). This means that GD and SF have the same ``measuring power'', whereas GD is a very restricted proper subclass of SF. Moreover, we give a purely algebraic characterisation of SF-measurable regular languages, which is a natural extension of Schutzenberger's theorem stating the correspondence between star-free languages and aperiodic monoids. We…
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 · Computability, Logic, AI Algorithms
