Prove that for any fixed m and n, the unary language {1m+ni | i ∈ N} is regular
Answers
Answered by
0
Answer:
this is math isn't it friend
Similar questions