Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
19 views

Assignment Unit 1 Automata

hhhhhhhhhhhhhhhhhhhhh

Uploaded by

Sameer Najam
Copyright
© © All Rights Reserved
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
19 views

Assignment Unit 1 Automata

hhhhhhhhhhhhhhhhhhhhh

Uploaded by

Sameer Najam
Copyright
© © All Rights Reserved
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 4

ASIGNMENT QUES NO.

BRANCH: CS 2nd YEAR (B)


SUBJECT: TAFL

Q1. What do you mean by the Kleene closure of set A?


Q2. Designing the FA recognizing the language over {a,b,c,d} which shall accept only those strings in
which no symbol appears in consecutive positions.
Q3. Construct an NFA which recognizes a set of strings containing three consecutive o’s and three
consecutive 1’s. Also correct this NFA into an equivalent DFA.
Q4. Discuss the various applications of finite automata.
Lexical Analysis in Compiler Design
Pattern Matching (KNP String matching algorithm)
Natural Language Processing (NLP)
Digital Circuit Design
Cryptography
Game Development
Q5. Let S = {ab,bb} and let T = {ab,bb,bbbb}, show that S* = T*.
Q6. Construct a DFA for the following language-
{am bn | m is divisible by 2 and n is divisible by 4
Q7. Describe in words the language accepted by the following finite automata:

Q8. Define non-deterministic finite automata. How does it differ from deterministic finite automat?

Q9. Convert following NFA to equivalent DFA and hence minimize the number of states in the DFA.

Q10. Let M1 and M2 be the FA recognizing the languages L1 and L2 respectively. Draw finite automata
which recognize the language L2 – L1.
Q11. Construct a DFA that accepts the strings which contains the alphabets pattern 0ll (∑ = {0, 1}).
Q12. For the given stale diagram of a NFA. Convert it to an equivalent DFA.

Q13. Minimize the DFA corresponding to NFA of question (12).


Q14. Consider the following diagram test whether the strings 110101 is accepted by the finite automata
represented by above transition diagram. Show the entire sequence of states traversed.

Q15. Give DFA accepting the following languages over the alphabet {O, 1} -
(i) The set of all strings with three consecutive zeros.
(ii) The set of all strings such that every block of 05 consecutive symbols contains at least two
zeros.
Q16. Construct DFA equivalent to the NFA-({p,q,r,s },{O,l},§,p,{s}), where § is given by

Q17. Describe in English the languages accepted by the following FAS.


Q18. Give DFA’s accepting the following languages over the alphabet {0, 1}
(i) The set of all string ending with 00.
(ii) The set of strings with 011 as a sub strings.
Q19. Design a NFA to recognize the following set of strings. 0101, 101, and 011.assume the alphabet
is {0, 1}. Hence obtained the equivalent DFA.
Q20. Convert the following NFA to equivalent DFA.

Q21. Construct DFA from the graph given below.

Q22. Design NFA to recognize the following sets of strings abc, abd and aacd. Assume the alphabet is
{a, b, c, d}.
Q23. Let ∑ = {a, b}. for each of the following languages over ∑, construct DFA.
(i) All string that exactly contain one ‘a’
(ii) All string beginning with ‘ab’
(iii) All string that contain either the sub string ‘aaa’ or ‘ bbb ‘.
Q24.

Q25. Draw NDFA with specified number of states to accept the following languages
(i) All strings that contain the substring 0|01. ( 5 states)
(ii) All strings such that the third symbol from the right end is a ‘0’. (4 states)
Q26. Draw DFA for the following language over {0, 1}.
(i) All string with even number of 0’s and even number of 1’s.
(ii) All strings of length at most five.
Q27. Minimize the given DFA.

You might also like