Abstract
Given an n-state unary finite automaton accepting a language T, and an ultimately periodic set S given as a union of arithmetic progressions that can be represented using nO(1) bits, and whose periods are mutually coprime, deciding whether T ⫅ S is in nO(log n) time. Dropping the mutual coprimality condition, this containment problem becomes NP-hard.
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 callDisclaimer: 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.
