After 2 hours, I will have a small quiz. Just need to help me finished the quiz in 2 hours. Attached files is a reference and example of the question what will exist in the quiz. Take a look and if you can solve the question, you can help me with my quiz
see attacted filessee attacted files see attacted files
- (10pts) Show that
- (8pts) Let {ab, aa, baa}. Which of the following strings are in : abaabaaabaa, aaaabaaaa, baaaaabaaaab, baaaaabaa? Which strings are in ?
- (10pts) Find a grammar for the language
- (10pts) Give a simple description of the language generated by the grammar with productions
- (10pts) Show that the grammars S à aSb | ab | and S à aaSbb | aSb | ab | are equivalent.
- (9pts) Which of the strings 0001, 01101, 00001101 are accepted by the DFA in the below figure?
- (12pts) For , construct DFA’s that accept the sets consisting of all strings with at least two a’s.
- (8pts) In the below figure, find .
- (8pts) For the NFA in the below Figure, find
- (15pts) Convert the NFA defined by
S à aaA,
A à bS,
S à.
(
(
(
With initial state and final state into an equivalent DFA
0 comments