CS2303 TOC 2 MARKS.pdf

# 2 it plays an important role in complier design 3 to

• Test Prep
• 20

This preview shows pages 2–6. Sign up to view the full content.

2. It plays an important role in complier design. 3. To prove the correctness of the program automata theory is used. 4. In switching theory and design and analysis of digital circuits automata theory is applied. 5. It deals with the design finite state machines. V1 V2 V4 V3 V1 V2 V4 V3

This preview has intentionally blurred sections. Sign up to view the full version.

III Year V Semester CSE CS2303 Theory of Computation Adhiparasakthi College of Engg., G.B. Nagar, Kalavai Page 3 of 20 9. Define Finite Automation. A finite automata is a collection of 5 tuples (Q, Σ. δ , q 0 , F ) where Q is a finite set of states, which is non empty. Σ is a input alphabet, indicates input set. δ is a transition function or a function defined for going to next state. q 0 is an initial state (q 0 in Q) F is a set of final states. Two types : Deterministic Finite Automation (DFA) Non-Deterministic Finite Automation. (NFA) 10. Define Deterministic Finite Automation. - The finite automata is called DFA if there is only one path for a specific input from current state to next state. - A finite automata is a collection of 5 tuples (Q, Σ. δ, q 0 , F ) where Q is a finite set of states, which is non empty. Σ is a input alphabet, indicates input set. δ is a transition function or a function defined for going to next state. q 0 is an initial state (q 0 in Q) F is a set of final states. 11. Define Non-Deterministic Finite Automation. The finite automata is called NFA when there exists many paths for a specific input from current state to next state. A finite automata is a collection of 5 tuples (Q, Σ. δ, q 0 , F ) where Q is a finite set of states, which is non empty. Σ is a input alphabet, indicates input set. δ is a transition function or a function defined for going to next state. q 0 is an initial state (q 0 in Q) F is a set of final states. S 0 S 2 q 2 S 1 1 0 1 1 0 0 S 0 S 2 q 2 S 1 1 0 1 1 0 0 q 2 q 0 q 1 q 2 0 1 0 1 1
III Year V Semester CSE CS2303 Theory of Computation Adhiparasakthi College of Engg., G.B. Nagar, Kalavai Page 4 of 20 12. Define NFA with transition. The is a character used to indicate null string. i.e the string which is used simply for transition from one state to other state without any input. A Non Deterministic finite automata is a collection of 5 tuples (Q, Σ. δ, q 0 , F ) where Q is a finite set of states, which is non empty. Σ is a input alphabet, indicates input set. δ is a transition function or a function defined for going to next state. q 0 is an initial state (q 0 in Q) F is a set of final states. 13. Design FA wh ich accepts odd number of 1’s and any number of 0’s. 14. Design FA to check whether given unary number is divisible by three. 15. Design FA to check whether given binary number is divisible by three. S 0 S 2 q 2 S 1 1 0 1 1 0 0 S 0 S 2 q 2 S 1 0 1 1 1 0 S 3 0 0 1 q 2 q 0 q 1 q 2 0 1 1 1 1 1 q 2 q 0 q 1 q 2 q 1 1

This preview has intentionally blurred sections. Sign up to view the full version.

III Year V Semester CSE CS2303 Theory of Computation Adhiparasakthi College of Engg., G.B. Nagar, Kalavai Page 5 of 20 16. Design FA to accept the string that always ends with 00.
This is the end of the preview. Sign up to access the rest of the document.
• Spring '18
• isha mam

{[ snackBarMessage ]}

### What students are saying

• As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

Kiran Temple University Fox School of Business ‘17, Course Hero Intern

• I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

Dana University of Pennsylvania ‘17, Course Hero Intern

• The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

Jill Tulane University ‘16, Course Hero Intern