3 Let The Finite Automaton A Be A 90 91 A B 90 6 91 Where 8 Go A 91 8 90 B 90 91 8 91 1 (25.68 KiB) Viewed 27 times
3 Let The Finite Automaton A Be A 90 91 A B 90 6 91 Where 8 Go A 91 8 90 B 90 91 8 91 2 (28.6 KiB) Viewed 27 times
3.) Let the finite automaton A be A = ({90, 91}, {a,b), 90, 6, {91}), where 8(go, a) = {91}, 8(90, b) = {90, 91}, 8(91, b) = {90}, A.) The finite automaton A is deterministic and completely defined. B.) The finite automaton A is nondeterministic and completely defined. C.) The finite automaton A is nondeterministic and partially defined. D.) The finite automaton A is deterministic and partially defined.
2.) Let the generative grammar G be G = ({S, A, B}, {x,y}, S, P), with production rules P = { S→ BABY, AB→ AryB, BAB→BayB, A → zB, B→x BABY, Bay, S A }. A.) The generative grammar G is context-free and not regular. B.) The generative grammar G is context-sensitive and not context-free. C.) The generative grammar G is unrestricted and not context-sensitive. D.) The generative grammar G is regular.
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!