3 votes 3 votes How many $2$ state DFA’s with the designated initial state can be constructed over the alphabet over the alphabet $\sum = \{a, b\}$ that accept universal language? $4$ $16$ $20$ $24$ Theory of Computation ace-test-series theory-of-computation finite-automata number-of-dfa + – Hirak asked May 22, 2019 edited May 29, 2019 by akash.dinkar12 Hirak 1.4k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
6 votes 6 votes Answer is 20. Please find the attachement for Explanation. ayushsomani answered Jun 2, 2019 edited Apr 5, 2021 by soujanyareddy13 ayushsomani comment Share Follow See all 2 Comments See all 2 2 Comments reply Hirak commented Jun 2, 2019 reply Follow Share Thanks.. :) 0 votes 0 votes Deterministic commented Apr 20, 2020 reply Follow Share @ayushsomani how are the transition for the last four dfas defined...as the first state has all transitions to itself...so how is the state Y reachable? 0 votes 0 votes Please log in or register to add a comment.
4 votes 4 votes this is the solution of above question. if any doubt then ask. Àbhíjèét Míshrà answered May 28, 2019 Àbhíjèét Míshrà comment Share Follow See 1 comment See all 1 1 comment reply Hirak commented Jun 2, 2019 reply Follow Share Thanks.. :) 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes Hi , Pl find snapshot. shashank nautiyal answered Jun 5, 2019 shashank nautiyal comment Share Follow See all 0 reply Please log in or register to add a comment.