if L is DFA-regular, L' is ?
Answers
Answered by
0
Answer:
fyicgjlcmhfskrydthlztuxrhlPEYzurlsulrxti
Answered by
4
Explanation:
Explanation: This is a simple example of a closure property: a property saying that the set of DFA-regular languages is closed under certain operations. 6. ... If ~L has k equivalent classes, then any DFA that recognizes L must have atmost k states. c) A language L is NFA-regular if and only if it is DFA-regular.
Similar questions