Scribd
Upload
35 views2 pages

Ass TOA 3 4 5

This document contains an assignment for a Theory of Automata and Formal Languages course at Shivalik College of Engineering. It includes 11 problems related to finite automata, regular expressions, context-free grammars, pushdown automata, and Turing machines. Students are asked to draw and convert different types of automata, minimize DFAs, design Mealy and Moore machines, work with grammars and languages, and design Turing machines to solve various language and string problems. The assignment is to be submitted on specified dates in April 2012.

Uploaded by

Sonu Negi
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
35 views2 pages

Ass TOA 3 4 5

This document contains an assignment for a Theory of Automata and Formal Languages course at Shivalik College of Engineering. It includes 11 problems related to finite automata, regular expressions, context-free grammars, pushdown automata, and Turing machines. Students are asked to draw and convert different types of automata, minimize DFAs, design Mealy and Moore machines, work with grammars and languages, and design Turing machines to solve various language and string problems. The assignment is to be submitted on specified dates in April 2012.

Uploaded by

Sonu Negi
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Shivalik College of Engineering

DEPARTMENT: CS/IT COURSE: B.TECH SEMESTER: IV SEM SUBJECT: Theory of Automata & FL SUBJECT CODE: TCS 403 SESSION: 2011-12

Assignment-3 [ to be submitted on 15/04/12] 1. Draw DFA for the following languages over (a b) a. All strings starting with abbb. b. All strings with abbb as a substring. c. All strings ending in abbb. 2. Draw a NDFA to accept strings over alphabet {0 1} such that the third symbol from the right end is 0. 3. Convert NFA shown in following figure to its corresponding DFA?

4. Convert NFA-empty transitions to NFA without empty transitions? Then convert to DFA?

5. Minimize the following DFA?(using subset construction method).

6. Construct finite automata for the following regular sets. a. 10+(0+1)0*1 b. 01[((10)*+111)*+0]*1 7. Convert the following Transition diagram into RE (Using state elimination algorithm)?

8. Convert the following FA into RE? (Using Ardens Theorem)

9. Design a Mealy machine that gives an output 1 if the input string ends in bab. 10. Design a Moore machine that gives an output 1 if the input string ends in bab.

11. Construct a Mealy machine that accepts strings ending in 00 and 11. Convert the same to a Moore machine?

1. 2. 3. 4.

5.

6. 7.

Assignment-4 [ submitted on 21/04/2012] Define Context Free Grammar? Give a suitable example? Give CFG for strings in a*b*? What is an ambiguous grammar? Explain with an example? Simplify the following grammar S->0A0|1B1|BB A->C B->S|A C->S| Eliminate non-reachable symbols from the given grammar. S-> aAa A->Sb|bCC C->abb E->aC Construct a PDA accepting {anbman|m,n >=1} by null store. Show that if L is generated by a CFG then there exists a PDA accepting L? Assignment-5 [submitted on 25/04/2012] Design a TM which accepts all strings of the form anbn for n>=1 and rejects all other strings? Design TM to reverse a string over {a b}. Design a TM to check whether a string over {a b} contains equal no of as and bs? Design a TM to increment a binary number by 1? Construct a two tape turing machine to recognize words of the form www over alphabet { a b}.

1. 2. 3. 4. 5.

You might also like