0 votes 0 votes Number of 2-state DFA's possible over sigma = { a,b }. with a designated initial state and a designated final state are ___. Theory of Computation theory-of-computation finite-automata + – Vicky rix asked Apr 15, 2017 • retagged Jun 4, 2017 by Arjun Vicky rix 360 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply papesh commented Apr 15, 2017 reply Follow Share 16 if final and initial state is fixed. if only initial state is fixed than there are 4 * 16 =64 for more imforation : https://gateoverflow.in/40678/ugcnet-dec2015-iii-27 2 votes 2 votes akash.dinkar12 commented Apr 15, 2017 reply Follow Share how many alphabets over which this DFA is defined??? 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes Let's take 2 states as q1 and q2.Now q1 on a can go to q1 or q2,q2 on a can go to q1 or q2.Similary for b.Hence 2^4=16 because initial and final states are fixed. Purvi Agrawal answered Apr 15, 2017 Purvi Agrawal comment Share Follow See all 0 reply Please log in or register to add a comment.
