Scribd
Upload
12 views2 pages

Flat Imp

The document outlines various tasks related to the design and analysis of sequence detectors, Mealy and Moore machines, and regular languages. It includes specific design problems, equivalence partitions, and justifications for the regularity of certain languages. Additionally, it discusses theoretical concepts such as the Pumping Lemma and Arden's Theorem, along with differences between deterministic and nondeterministic automata.

Uploaded by

jn.aditya21
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
12 views2 pages

Flat Imp

The document outlines various tasks related to the design and analysis of sequence detectors, Mealy and Moore machines, and regular languages. It includes specific design problems, equivalence partitions, and justifications for the regularity of certain languages. Additionally, it discusses theoretical concepts such as the Pumping Lemma and Arden's Theorem, along with differences between deterministic and nondeterministic automata.

Uploaded by

jn.aditya21
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

FLAT STRATEGY (22 Q)

IMPORTANT
21. Design a two input two output sequence detector which generates an o/p
1 every time the sequence 1001 is detected. And for all other cases output ‘0’
is generated.
Overlapping sequences are also counted. (7 MARKS)

22. Design a two input two output sequence detector which generates an o/p
1 every time the sequence 1010 is detected. And for all other cases output ‘0’
is generated. Overlapping sequences are also counted. (7 MARKS)

25. Construct a Mealy Machine which is equivalent to the Moore machine


given below:

27. Construct a Moore Machine which is equivalent to the Mealy machine


given below:

28. Convert the following Mealy machine into equivalent Moore machine.

29. Construct a Moore Machine equivalent to the Mealy machine given below:

31. Find the equivalence partition for the machine shown in Table –I. Show a
standard
form of the corresponding reduced machine and find a minimum length
sequence that distinguishes state A from state B.

32. Find the equivalence partition for the machine shown in Table –II

40. Justify whether the language L = { ap : p is prime} is regular or not.


42. Justify whether the language L= {0i1i| i≥0 } is regular or not .
43. Justify whether the language L= {ai2| i≥1 } is regular or not.
44. Justify whether the language L= {ai3| i≥1 } is regular or not.

41. State and discuss Pumping Lemma for regular language.

37. State and prove Arden’s Theorem


39. Construct a regular expression (using Arden’s Theorem) corresponding to
the state diagram described by the following fig.

69. Design a Moore machine for a binary input sequence such that if it has a
substring 101, the machine output A, if the input has substring 110, it outputs
B otherwise it outputs C.

70. Design a Moore machine with the input alphabet {0, 1} and output
alphabet {Y, N} which produces Y as output if input sequence contains 1010 as
a substring otherwise, it produces N as output.

71. Design a mealy machine that scans sequence of input of 0 and 1 and
generates output 'A' if the input string terminates in 00, output 'B' if the string
terminates in 11, and output 'C' otherwise.

72. Design a Mealy machine for a binary input sequence such that if it has a
substring 101, the machine output A, if the input has substring 110, it outputs
B otherwise it outputs C

DIFFRENCE. (1 Q FROM THIS)

1 State the differences between DFA and NFA.

5. Differentiate between Kleene Closure and Positive closure. What do you


mean by dead

54. Explain the difference between the deterministic and nondeterministic


Pushdown automata. Give one example of each.

You might also like