0 votes 0 votes what is the grammar generated by the complement of this DFA and what is the type? Theory of Computation finite-automata + – aditi19 asked Aug 29, 2018 aditi19 674 views answer comment Share Follow See all 4 Comments See all 4 4 Comments reply aditi19 commented Aug 29, 2018 reply Follow Share I got this as the compliment of this DFA. what is the grammar generated by this DFA? 0 votes 0 votes MiNiPanda commented Aug 29, 2018 reply Follow Share i am getting reg expression as 1*. 0 votes 0 votes aditi19 commented Aug 29, 2018 reply Follow Share so it's type 3 grammar? 0 votes 0 votes MiNiPanda commented Aug 29, 2018 reply Follow Share Yup..complement of Reg Language is Regular only.. 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes require R.E=$\epsilon$ +1.1* and grammer is S->1S/1/$\epsilon$ and it is right linear grammer. BASANT KUMAR answered Aug 21, 2019 BASANT KUMAR comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes The grammar in question is any string containing at least 1 zero. So, the complement would be the collection of string containing no zero at all. Vinay Patel answered Aug 29, 2018 Vinay Patel comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes 1* and it is type 3 grammar bcz complement of regular language is also regular navya n answered Aug 30, 2018 navya n comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes regular language is closed under complementation.so it will be regular and grammar generated by its complement will be strings not containing 0. garimanand answered Sep 24, 2018 garimanand comment Share Follow See all 0 reply Please log in or register to add a comment.