Scribd
Upload
4 views

TOC Assignment-1

Uploaded by

bhavanabiradar5
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
4 views

TOC Assignment-1

Uploaded by

bhavanabiradar5
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

CAMBRIDGE INSTITUTE OF TECHNOLOGY, BANGALORE

DEPARTMENT OF ISE

TOC ASSIGNMENT - 1

MODULE - 1
1. Define the following terms with an example
(a) Alphabet
(b) Power of an Alphabet
(c) String, Prefix, Suffix
(d) String Concatenation
(e) Language
2. Explain the hierarchy of languages in automata theory with diagram.
3. Define DFSM for the following
I. L={ W | W ∈ {0,1}* : W does not end in 01 }
II. L={ W | W ∈ {a,b}* : every a in W is immediately preceded and followed by b }
III. To accept strings over { a, b } such thar each block of 5 (length five)
consecutive symbols have atleast two a’s.
IV. Design a DFA L(M) = {w | w ε {0, 1}*} and W is a string that does not
contain three consecutive 1's.
V. Design FA with ∑ = {0, 1} accepts even number of 0's and even number of 1's.
4. Convert following NDFSM to its equivalent DFSM

5. Convert the following ε – NFA to DFA

6. Use MiNDFSM algorithm to minimize the following figure:


CAMBRIDGE INSTITUTE OF TECHNOLOGY, BANGALORE
DEPARTMENT OF ISE

TOC ASSIGNMENT - 1

7. Define distinguishable and indistinguishable states. Minimize the following DFSM


δ 0 1
→A B A
B A C
C D B
*D D A
E D F
F G E
G F G
H G D

MODULE – 2

8. Define Regular expression. Write regular expression for the following language.
i) L = { 0m1n | m>=1, n>=1, mn>=3 }
ii) L = { W ∈ {a, b}* : string with atmost one pair of consecutives a’s }
9. Obtain NDFSM for the regular expression (a* U ab) (a U b)* .
10. Build a regular expression for the given FSM

11. State and prove pumping lemma theorem for regular language.
12. Write regular expression, regular grammar and FSM for the languages
L = { W ∈ {a, b}* : W ends with pattern aaaa }
13. State and prove pumping lemma theorem for regular languages
L = { anbn | n ≥ 0 } is not regular }
14. Obtain NDFSM for the following regular expression (a + b) * abb.
15. Design a Finite Automata from the given RE [ ab + (b + aa)b* a ].
16. Find Regular expression by state elimination method.

You might also like