3 votes 3 votes How many 2 state DFA’s with designated initial state can be constructed over the alphabet Σ = {a, b} that accept empty language ϕ ? (a) 4 (b) 16 (c) 20 (d) 24 Theory of Computation theory-of-computation number-of-dfa finite-automata + – Hirak asked May 22, 2019 • retagged Jun 12, 2019 by Pooja Khatri Hirak 2.5k views answer comment Share Follow See all 6 Comments See all 6 6 Comments reply prashant jha 1 commented May 23, 2019 reply Follow Share is it 16? 0 votes 0 votes Satbir commented May 23, 2019 reply Follow Share what does designated initial state means ? 0 votes 0 votes prashant jha 1 commented May 23, 2019 reply Follow Share intial state can be chosen in only one way. 0 votes 0 votes Satbir commented May 23, 2019 reply Follow Share means if we select A as initial state in DFA1 then in DFA 2 also A will be the initial state ? 0 votes 0 votes akash.dinkar12 commented May 23, 2019 reply Follow Share https://gateoverflow.in/16808/many-state-drawn-over-alphabet-which-accepts-empty-language 1 votes 1 votes Srken commented Sep 4, 2022 reply Follow Share Initial state has been already defined and that initial state can accept the empty language 0 votes 0 votes Please log in or register to add a comment.
3 votes 3 votes We should deal this type of questions using State transistion table [ Jiren ] answered Sep 4, 2022 [ Jiren ] comment Share Follow See all 0 reply Please log in or register to add a comment.
2 votes 2 votes case1:when no final state to be chosen. then dfa possible=2^4=16. case2:when X is initial state and Y is final state but unreachable from X then dfa possible =2^2=4 therefore in total dfa possible is =16+4=20.Ans Àbhíjèét Míshrà answered May 28, 2019 Àbhíjèét Míshrà comment Share Follow See all 2 Comments See all 2 2 Comments reply Srken commented Sep 4, 2022 reply Follow Share But initial state can accept the empty language means initial state is also a final state right ?? 0 votes 0 votes [ Jiren ] commented Sep 4, 2022 reply Follow Share @Srken In Empty language there are no strings present right you are confusing between Empty language and Empty string Dfa has initial state as final state if it accepts Empty string ϵ and not Empty Language 0 votes 0 votes Please log in or register to add a comment.