PyQdeck LogoPyQdeckSubjects
Back to the 2019 paper

Module 1: Introduction, Regular languages and finite automata

20197m

Construct a Moore machine which determines the residue mod 3 for each binary string treated as binary integer. And then convert into the corresponding Mealy machine.

Search GoogleAsk AI

Similar questions

FORMAL LANGUAGE & AUTOMATA THEORYThe total number of states and transitions required to form a Moore machine that produces residue mod 3 are: (i) 3 and 6 (ii) 3 and 5 (iii) 2 and 4 (iv) 2 and 520222mFORMAL LANGUAGE & AUTOMATA THEORYConstruct a Moore machine equivalent to the given Mealy machine.20237mDIGITAL ELECTRONICSDesign a 3-bit binary counter using T flip-flops.20237mFORMAL LANGUAGE & AUTOMATA THEORYDesign Mealy and Moore machines to detect the sequence 1010 (overlapping allowed). Then convert the Moore machine into a Mealy machine and prove equivalence.20227m
PreviousDesign a push-down automata for accepting the string for the language L = \{WW^R \mid W \in \{a, b\}^*\} by the empty stack as well as final state.NextDesign finite state machine or abstract model for binary adder.