0 votes 0 votes How many Moore machines are possible with two states X and Y for the input alphabet {a,b} and output alphabet {0,1}, where X is always the initial state? Theory of Computation theory-of-computation finite-automata + – debanjan sarkar asked Jan 4, 2019 debanjan sarkar 587 views answer comment Share Follow See all 10 Comments See all 10 10 Comments reply Show 7 previous comments Shobhit Joshi commented Jan 4, 2019 reply Follow Share @balchandar reddy san moore and mealey are DFA, so $\phi$ should not be a in the transition 0 votes 0 votes Shaik Masthan commented Jan 4, 2019 reply Follow Share is melay/moore machine need final states ? 0 votes 0 votes Shobhit Joshi commented Jan 4, 2019 reply Follow Share they don't need it, corrected 0 votes 0 votes Please log in or register to add a comment.
