0 votes 0 votes Find DFA for the following language $L=\left \{ ba^n : n>=1,n\neq 4 \right \}$ Theory of Computation theory-of-computation peter-linz + – MayankSharma asked Sep 23, 2017 • edited Sep 23, 2017 by LeenSharma MayankSharma 1.8k views answer comment Share Follow See all 6 Comments See all 6 6 Comments reply Show 3 previous comments MayankSharma commented Sep 23, 2017 reply Follow Share OK Solution?? Pls 0 votes 0 votes joshi_nitish commented Sep 23, 2017 reply Follow Share dfa will be, 0 votes 0 votes MayankSharma commented Sep 23, 2017 reply Follow Share Thanks a lot Good day 0 votes 0 votes Please log in or register to add a comment.
Best answer 6 votes 6 votes ...... LeenSharma answered Sep 23, 2017 • selected Sep 23, 2017 by Arjun LeenSharma comment Share Follow See all 5 Comments See all 5 5 Comments reply Show 2 previous comments akash.dinkar12 commented Sep 23, 2017 reply Follow Share @Leen Sharma, plz explain language and what are the strings belong to this language??? 0 votes 0 votes LeenSharma commented Sep 24, 2017 reply Follow Share $L=\left \{ ba^n : n>=1,n!=4 \right \}$ In given language, every string should start with b and after that, any number of a's can occur except 4a's(given n!= 4). String that Belongs to the language $L= \left \{ ba,baa,baaa,baaaaa......\right \}$ String that not Belongs to the language $L= \left \{ \epsilon,baaaa,b,bb,bbb,ab,abb,abbb......\right \}$ 0 votes 0 votes akash.dinkar12 commented Sep 24, 2017 reply Follow Share thanx... 0 votes 0 votes Please log in or register to add a comment.