1 votes 1 votes For the given Grammar S->aA|bB A->bC|aS B->aC|bS C->aB|bA Construct DFA I am getting confused in understanding how to take the final state. Theory of Computation theory-of-computation finite-automata regular-grammar number-of-dfa minimal-state-automata + – sripo asked Oct 13, 2018 sripo 1.3k views answer comment Share Follow See all 6 Comments See all 6 6 Comments reply Show 3 previous comments sripo commented Oct 13, 2018 reply Follow Share So is the question wrong cause it is supposed to check if grammar generates even number of a's or b's 0 votes 0 votes Verma Ashish commented Oct 13, 2018 reply Follow Share Yes. This is not the grammar generating even no. of a's and b's..it is not halting. :/ 0 votes 0 votes sripo commented Oct 14, 2018 reply Follow Share It is a test series question :)p but I wanted to clarify for conceptual clarity.Super Thanks. 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes w:aaaabbbbaaaa for any random string if the given grammar generate it,then we definitely can draw DFA,otherwise not. and since the grammar doesnot have any terminating condition ,therefore,it is not possible. Àbhíjèét Míshrà answered Mar 10, 2019 Àbhíjèét Míshrà comment Share Follow See all 0 reply Please log in or register to add a comment.
