{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

Mealy - Moore Machines

# Mealy - Moore Machines - Mallard ECE 290 Computer...

This preview shows pages 1–2. Sign up to view the full content.

Mallard ECE 290: Computer Engineering I - Spring 2007 - Graded Web... https://mallard.cites.uiuc.edu/ECE290/webgrade.cgi?SessionID=mding3... 1 of 2 4/13/2007 3:42 PM Graded WebQuiz: Mealy - Moore Machines You have submitted this WebQuiz 2 times (including this time). You may submit this WebQuiz a total of 10 times and receive full credit. Question #1 In a Mealy machine, the output is a function of only the present state You received a raw score of 0% on this question. Question #2 Suppose a Mealy machine M has 3 inputs and 15 outputs and is being implemented with 9 flip-flops. Note: For the following blanks, if the answer is e.g. 2 12 , you can enter 2**12 or 2^12 rather than 4096. Minimum possible Maximum possible How many states does M have? 1 2^9 = 512 How many state transitions leave a given state? 2^3 = 8 2^3 = 8 How many state transitions enter a given state? 0 2^9*2^3 = 4096 You received a raw score of 100% on this question. Question #3 For every n-state q-output Mealy machine, there is an equivalent q-output Moore machine with at most nq + 1 * states.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}