0 votes 0 votes If L ≠ ∅ and L is regular then L is the union of regular language A1, . . . , An where each Ai is accepted by a DFA with exactly one final state .Please elaborate how this statement is true. Theory of Computation theory-of-computation regular-language + – Shivangi Parashar 2 asked Jan 7, 2019 Shivangi Parashar 2 299 views answer comment Share Follow See 1 comment See all 1 1 comment reply smsubham commented Jan 7, 2019 reply Follow Share So, we know that there are regular languages, and non-regular languages, and they can all be expressed as infinite unions or intersections of regular languages. Read this: https://cs.stackexchange.com/questions/67316/infinite-intersection-union-of-regular-languages 0 votes 0 votes Please log in or register to add a comment.
