Solve the problem showing all steps. Thoroughly explain how and why you performe
ID: 3541645 • Letter: S
Question
Solve the problem showing all steps. Thoroughly explain how and why you performed each step with complete sentences.
A finite-state automaton is given by the 5-tuple (Q, ?, ?, q, F), where
Q = the finite set of states = {A, B, C}
? = the Alphabet (inputs) = {x, y}
? = the transition function using the alphabet as inputs to the states
q = the initial state = {A}
F = Accepting (or final) state = {C}
The transition table for the automaton is given by:
?
?
x
y
A
A
B
B
A
C
C
A
C
(i). Draw the corresponding transition diagram (digraph).
Draw diagram here
(ii). Provide 5 strings that are in the language generated by the automaton.
Provide strings here
(iii). Provide 5 strings, that use the same inputs, which are not in the language generated by the automata.
Provide strings here
(iv). Write a general statement that describes when a string is part of the language generated by the above automata and when that string is not in the language.
Provide statement here
?
?
x
y
A
A
B
B
A
C
C
A
C
Explanation / Answer
ii)5 strings in this language
---1)xyy
2)xxyy
3)xxxyy
4)xyyy
5)xyyyyy
iii)5 strings not in this language
---1)xy
2)xxy
3)xxxy
4)xxxxxy
5)xxxxxxxy
Related Questions
drjack9650@gmail.com
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.