0 votes 0 votes Theory of Computation theory-of-computation finite-automata + – abhinowKatore asked Mar 7, 2022 abhinowKatore 349 views answer comment Share Follow See all 4 Comments See all 4 4 Comments reply Shaik Masthan commented Mar 7, 2022 reply Follow Share mention the source of the question in the title like xxx-test-series, xxx-book-chapter4-question2 etc. Otherwise question will be deleted (applicable to all questions) 1 votes 1 votes raja11sep commented Mar 8, 2022 reply Follow Share None. option A will be correct if we change the second state from final to non-final. L = { all strings containing “000” as a substring } 1 votes 1 votes abhinowKatore commented Mar 8, 2022 reply Follow Share Thank you for the clarification 😄 0 votes 0 votes Shaik Masthan commented Mar 8, 2022 reply Follow Share @raja11sep what’s the problem with option B and C ? ( when you tried to rectified option A, then you can rectify other options too ) 0 votes 0 votes Please log in or register to add a comment.
