What type of Finite Automata (FA) is Figure 2, and which one of
these strings is acceptable by the FA? Note that DFA stand for
Deterministic Finite Automata while NFA stand for Non-deterministic
Finite Automata.
Select one:
A. DFA, aba
B. NFA, aba
C. a and b
D. NFA, ab
can i please get this under 20mins
What Type Of Finite Automata Fa Is Figure 2 And Which One Of These Strings Is Acceptable By The Fa Note That Dfa Sta 1 (39.09 KiB) Viewed 37 times
Figure 2 a a a S1 Start So b a, a S2
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!