0 0 votes construct the minimal DFA for the language L={ 3rd symbol from the R.H.S is 'a'} and ∈={a.b}. Theory of Computation finite-automata theory-of-computation minimal-state-automata + – jaiganeshcse94 1.6k views answer comment Share Follow Print 0 reply Please log in or register to add a comment.
Best answer 2 2 votes Here is your answer aehkn answered Sep 26, 2017 • selected Sep 26, 2017 by jaiganeshcse94 aehkn comment Share Follow See all 3 Comments 3 3 Comments reply jaiganeshcse94 commented Sep 26, 2017 reply Follow flag thank you . 0 0 replyShare Saurabh Agrawal commented Nov 8, 2018 reply Follow flag well, transition table is correct but there's a mistake in the transition diagram. Transition of 134 state on input b is wrong. According to table it will be derives to 14 state whereas you derived it to 13 state. please make sure to correct it. rest all fine. 0 0 replyShare kumar.dilip commented Nov 9, 2018 reply Follow flag Bor, the table is correct. 0 0 replyShare Please log in or register to add a comment.
0 0 votes Hope this will help out sandeepjkh answered Oct 2, 2017 sandeepjkh comment Share Follow 0 reply Please log in or register to add a comment.
0 0 votes ....... LeenSharma answered Oct 2, 2017 LeenSharma comment Share Follow 0 reply Please log in or register to add a comment.
0 0 votes ..... LeenSharma answered Oct 2, 2017 LeenSharma comment Share Follow 0 reply Please log in or register to add a comment.