The omega-inequality problem for concatenation hierarchies of star-free languages
J. Almeida, O. Kl\'ima, M. Kunc
TL;DR
This paper proves that determining the validity of omega-term inequalities in any level of the Straubing-Thérouin hierarchy of star-free languages is a decidable problem, advancing understanding of formal language hierarchies.
Contribution
It establishes the decidability of the omega-inequality problem across all levels of the concatenation hierarchy of star-free languages.
Findings
Decidability of omega-inequality problem for all hierarchy levels
Applicable to both integer and half levels
Enhances understanding of formal language hierarchies
Abstract
The problem considered in this paper is whether an inequality of omega-terms is valid in a given level of a concatenation hierarchy of star-free languages. The main result shows that this problem is decidable for all (integer and half) levels of the Straubing-Th\'erien hierarchy.
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.