Scribd
Upload
39 views4 pages

Assignment Automata Theory

The document contains a series of assignments related to Automata Theory, including tasks to draw Deterministic Finite Automata (DFA) for various languages defined over specific input alphabets. It also includes assignments for converting Non-deterministic Finite Automata (NFA) to DFA, finding regular expressions for given DFA, and designing Moore and Mealy machines based on specific conditions. Additionally, there are tasks to construct Pushdown Automata (PDA) for certain languages and palindromes.

Uploaded by

muzain925
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
39 views4 pages

Assignment Automata Theory

The document contains a series of assignments related to Automata Theory, including tasks to draw Deterministic Finite Automata (DFA) for various languages defined over specific input alphabets. It also includes assignments for converting Non-deterministic Finite Automata (NFA) to DFA, finding regular expressions for given DFA, and designing Moore and Mealy machines based on specific conditions. Additionally, there are tasks to construct Pushdown Automata (PDA) for certain languages and palindromes.

Uploaded by

muzain925
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

Assignment

Automata Theory
Q1: Draw a DFA for the language accepting strings ending with ‘abb’ over input alphabets
∑={a,b}.
Q2: Draw a DFA for the language accepting strings ending with ‘abba’ over input alphabets
∑={a,b}.
Q3: Draw a DFA for the language accepting strings ending with ‘0011’ over input alphabets
∑={0,1}.
Q4: Draw a DFA for the language accepting strings starting with ‘ab’ over input alphabets
∑={a,b}. Also draw the regular expression for the given language.
Q5: Draw a DFA for the language accepting strings starting with ‘a’ over input alphabets
∑={a,b}
Q6: Draw a DFA for the language accepting strings starting with ‘101’ over input alphabets
∑={0,1}.
Q7: Draw a DFA that accepts the language L over input alphabets ∑= {0,1} such that L is the
set of all strings starting with 00.
Q8: Construct a DFA that accepts the language L over input alphabets ∑={a,b} such that L is
the set of all strings starting with’ aa’ or ‘bb’.
Q9: Construct a DFA that accepts the language L over input alphabets ∑={a,b} such that L is
the set of all strings starting with’ aba’.

Q10: Consider the language L(M)= { ( 10 )n : n>=0 } Draw NFA and also equivalent
DFA.
Q11: Covert the following NFA to DFA.

Q12: Covert the following NFA to DFA.


Q13: Find Regular expression for the following DFA.

Q14: Find Regular expression for the following DFA.

Q15: Find Regular expression for the following DFA.


Q16: Find Regular expression for the following DFA.

Q17: Design a Moore machine for a binary input sequence such that if it has a sub string 101,
the machine output A, if the input has sub string 110, it output B, otherwise it output C.
Q18: Design a Moore machine that determines whether an input string contains even or odd
number of 1’s. The machine should give 1 as output if an even number of 1’s are in the string
and 0 otherwise.
Q19: Design a Mealy machine for a binary input sequence such that if it has a sub string 101,
the machine output A, if the input has sub string 110, it output D, otherwise it output K.
Q20: Convert the following Mealy machine into equivalent Moore machine.
Q21: Design an NFA with ∑= {0,1} accepts all strings ending with 01.
Q22: Design an NFA with ∑= {0,1} in which double 1 is followed by double 0.
Q23: Design an NFA with ∑= {0,1} in which all the strings contain a sub string 1110.
Q24: Covert the following NFA with ℇ to NFA without ℇ.

Q25: Draw a deterministic push down Automata(DPDA) for the following palindrome of odd
length.
L= ‘ racecar’

Q26: Construct a PDA that accepts L = {0n 1n | n ≥ 0}


Q27: Construct a PDA that accepts L = { wwR | w = (a+b)* }
Q28: Construct a DPDA for the language L = an b2n, n > 0 over ∑={a,b}.

You might also like