Abstract
Given a finite alphabet A and a sequence of positive integers [Formula: see text] congruences on A*, denoted by [Formula: see text] and related to a version of the Ehrenfeucht-Fraïssé game, have been defined by Thomas in order to give a new proof that the Brzozowski’s dot-depth hierarchy of star-free languages is infinite. A natural extension of some of the results of Thomas states that the monoid variety corresponding to level k of the Straubing hierarchy (the Straubing hierarchy is closely related to the Brzozowski’s dot-depth hierarchy) can be characterized in terms of the monoids [Formula: see text]. In this paper, it is shown that the dot-depth of the [Formula: see text]’s is computable.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Foundations of Computer Science
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
