495 views
3 votes
3 votes

I got 3 states...

Given is 4 

2 Answers

0 votes
0 votes
S -> Xa|Ya

S -> Zaa|Wa

S -> Saaa|Saa|E

as there is a possibility of coming aaa as the substring of the given language. So it will contain 4 states to achieve it.

Related questions

3 votes
3 votes
2 answers
1
0 votes
0 votes
1 answer
2
Hirak asked May 22, 2019
553 views
is union of regular language and context free language always regular?
0 votes
0 votes
0 answers
3
admin asked Apr 6, 2019
217 views
Show that every regular language is a context-free language. Hint$:$ Construct a $CFG$ by induction on the number of operators in the regular expression.
2 votes
2 votes
1 answer
4