Abstract

In this paper we are interested in the bi-infinite words and mainly in the bi-infinite power of languages of finite words. With the aim of deciding whether, given a rational language R, ω R ω is finitely generated, i.e. whether ω R ω= ω R ω for some finite set F, we study the notions of bilimit and biadherence. The stated results become then efficient tools for solving the initial decision problem.

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.