Subscribe to:
Post Comments
(
Atom
)
Prove that, a language L is accepted by some ϵ-NFA if and only if L is accepted by some DFA.
What does extended transition function mean?
![]() | ![]() ![]() | ![]() | ||
![]() | ![]() | ![]() | ||
![]() ![]() | ![]() ![]() | |||
![]() |
| ![]() |
i didnot get all question can you sent me link thast why i can found esaily
ReplyDelete