Practical-1(RCS-453)

Q.1 Construct Deterministic Finite Automata (DFA) for L={w | w (starts with a & even #a’s) or ( starts with b & odd # a’s)}.
Q.2 Design a Moore machine which reads input from (0+1+2)* and outputs residue 5 of the input. Input is considered at base 3
and it is treated as ternary integer.

Practical-2(RCS-453)
Q.1 Construct Non Deterministic Finite Automata (NDFA/NFA) for L={(ab)*U aa*}.
Q.2 Design a moore machine with input alphabet{0,1} and output alphabet{Y,N} which produce Y as output if input sequence
contains 1010 as substring, otherwise it produce N as output.

Practical-3(RCS-453)
Q.1 Construct Deterministic Finite Automata (DFA) for L={w| na(w) mod 3=2 & nb(w) mod 2=1}.
Q.2 Design a mealy machine to convert each occurrence of abb by aba, ∑={a,b}.

Practical-4(RCS-453)
Q.1 Construct Non Deterministic Finite Automata (NDFA/NFA) for L={vwv| v,wƐ{a,b}*, |v|=2}.
Q.2 Design a mealy machine which has input as binary number and output is the sum of three consecutive Symbols.(output is in decimal).

Practical-5(RCS-453)
Q.1 Construct Deterministic Finite Automata (DFA) for All Strings containing CAT or RAT as a substring where ∑={C,H,A.R,O,T}.
Q.2 Design a mealy machine to add two binary numbers.

Practical-6(RCS-453)
Q.1 Construct Non Deterministic Finite Automata (NDFA/NFA) for All strings that contains the substring 0|01(5 states).
Q.2 Design a mealy machine which reads the input from (0+1)* and produces the following outputs.
(i)if input ends in 101, output is A. (ii)if input ends in 110, output is B. (iii)Otherwise output is C.

Practical-7(RCS-453)
Q.1 Construct Deterministic Finite Automata (DFA) for L={ w | |w| mod 3=0,|w|≠6}.
Q.2 Draw finite automata recognizing the following language: 1(1+10)*+10(0+01)*.

Practical-8(RCS-453)
Q.1 Design NFA with 3 states that accepts , L={a |n>=1}U {bm ak |m>=0,k>=0}.
n

Q.2 Show that the following language is regular: L={an |n>4}.

Practical-9(RCS-453)
Q.1 Construct Deterministic Finite Automata (DFA) for L={wε∑*| all strings containing 00 but not 000}.
Q.2 Let L={01}{0,1}*, construct NFA with Ɛ-moves that accept L2.

Practical-10(RCS-453)
Q.1 Construct Deterministic Finite Automata (DFA) for L={the set of all strings such that every block of three consecutive symbols contains
at least two zeros}.
Q.2 Construct Regular Expressions for The set of all strings in which every pair of adjacent zero’s appears before any pair of adjacent one’s.
.