Scribd
Upload
3 views3 pages

Sa-Set A

The document outlines a set of short answer questions for a Theory of Computation course, focusing on concepts related to automata theory, including definitions and examples of NFAs, DFAs, and various forms of proofs. It includes questions on language acceptance, state transitions, and specific language constructions. The exam is structured for third-year students in their fifth semester, with a maximum time of 30 minutes and a total of 30 marks.

Uploaded by

murali23112005
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
3 views3 pages

Sa-Set A

The document outlines a set of short answer questions for a Theory of Computation course, focusing on concepts related to automata theory, including definitions and examples of NFAs, DFAs, and various forms of proofs. It includes questions on language acceptance, state transitions, and specific language constructions. The exam is structured for third-year students in their fifth semester, with a maximum time of 30 minutes and a total of 30 marks.

Uploaded by

murali23112005
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/ 3

Department of CSE

Course Code / Course Name : 23CS1502 / Theory of Computation

UNIT I – SHORT ANSWER – SET A


Year/Semester : III / V Max Time : 30 Mins
Regulation : 2023 Max Marks : 30

1. What is the complement of the language accepted by the NFA shown CO1
below? Assume ∑ = {a} and ε is the empty string.

2. Consider the set of strings on {0,1} in which, every substring of 3 CO1


symbols has at most two zeros. For example, 001110 and 011001 are in
the language, but 100010 is not. All strings of length less than 3 are also
in the language. A partially completed DFA that accepts this language is
shown below.

3. Define inductive proof. CO1


4. Give some examples for additional forms of proof CO1
5. Define Deterministic Finite Automation. CO1
6. Define Non-Deterministic Finite Automation. CO1
.
7. What is ε-closure of a state q0? CO1
8. Define the language accepted by a NFA CO1
9. Define the language accepted by a DFA CO1
10. Define L* CO1
11. Define L+ CO1
12. What does this NFA accept? CO1

13. John is asked to make an automaton which accepts a given string for all CO1
the occurrence of ‘0110’ in it. How many number of transitions would
John use such that, the string processing application works?
14. How is NFA different from DFA? CO1
15. A deterministic finite automation (DFA)D with alphabet ∑= {a,b} is CO1
given below

Which of the following finite state machines is a valid minimal DFA


which accepts the same language as D?

16. What is ε-closure of a state q0? CO1


17. Define deductive proof . CO1
18. Define inductive proof. CO1
19. Define Non-Deterministic Finite Automation. CO1
20. Differentiate between proof by contradiction and proof by CO1
contrapositive.
21. Whlich of the following will not be accepted by the following DFA? CO1
22. What is a formal proof in automata theory? CO1
23. What does the following figure most correctly represents? CO1

24. Give NFAs with the specified number of states recognizing each of the CO1
following language. In all cases, the alphabet is Σ = {0, 1}.The language
{ w ∈ Σ∗ | w contains at least two 0s, or exactly two 1s } with six states.
25. Construct a DFA that accepts a language L over input alphabets ∑ = {a, CO1
b} such that L is the set of all strings starting with ‘aa’ or ‘bb’.
26. Construct a DFA for the language over {0, 1}* such that it contains “000” CO1
as a substring.
27. Draw a DFA that accepts set of all strings containing 1011 as a CO1
substring in it.
28. Construct deterministic finite automata to recognize odd number of 0’s CO1
and even number of 1’s?
29. Define Deductive Proof. CO1
30. Construct DFA which accepts a string that contains second symbol is CO1
zero and fourth symbol is 1 over an alphabet ∑={0,1}.

You might also like