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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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
