Consider a language ‘L’ defined over ∑= {a, b, c} such that it contains all words in which ‘b’ occurs exactly once in a string.
Consider a language ‘L’ defined over ∑= {a, b, c} such that it contains all words in which ‘b’ occurs exactly once in a string.
a. Construct a Finite Automata (FA) for the language ‘L’.
b. Construct a Transition Graph for the language ‘L’.
c. Construct a Generalized Transition Graph for the language ‘L’.
Solution
a. Construct a Finite Automata (FA) for the language ‘L’.
b. Construct a Transition Graph for the language ‘L’.
c. Construct a Generalized Transition Graph for the language ‘L’.
No comments