Abstract

A class TC(X) of X-graphs is introduced, and an algorithmic property of labellings of finite strongly connected graphs by rational languages is shown to be decidable. This property, named as TC-inevitability, is a language theoretic analogue of the R -inevitability of labellings of finite strongly connected graphs by finite monoids. As a consequence, the pseudovariety R of all finite R -trivial monoids is shown to be hyperdecidable relative to the class of labellings of finite strongly connected graphs by finite monoids. Strong decidability of the dual pseudovariety L follows as a corollary and a few applications to decidability results are provided.

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 call

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.