The omega-inequality problem for concatenation hierarchies of star-free languages
classification
🧮 math.GR
cs.FL
keywords
problemconcatenationhierarchylanguagesstar-freeconsidereddecidableerien
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.