0 votes 0 votes With $Σ = $ {$a,b$} , give a dfa for $L =$ {$w_1aw_2: |w_1|≥ 3, |w_2|≤ 5$}. Theory of Computation theory-of-computation peter-linz peter-linz-edition4 finite-automata + – Harshitha 123 asked Jun 16, 2018 • edited Mar 19, 2019 by Naveen Kumar 3 Harshitha 123 759 views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply pbainsla commented Jul 1, 2018 reply Follow Share its an eleven state dfa for this problem 0 votes 0 votes akash.dinkar12 commented Jul 1, 2018 reply Follow Share https://gateoverflow.in/118160/gate2017-2-25 0 votes 0 votes Deepak Poonia commented Aug 18, 2019 reply Follow Share Refer here for this question : https://gateoverflow.in/71356/peter-linz 1 votes 1 votes Please log in or register to add a comment.
0 votes 0 votes .............. abhishekmehta4u answered Mar 3, 2019 abhishekmehta4u comment Share Follow See 1 comment See all 1 1 comment reply Shaik Masthan commented Aug 24, 2019 reply Follow Share asked for DFA but not for NFA 0 votes 0 votes Please log in or register to add a comment.