Scribd
Upload
6 views3 pages

Automata and Complexity Theory Mid Term Exam Time Allowed 1:45

The document is a midterm exam for a course on automata and complexity theory, consisting of multiple-choice questions covering topics such as finite automata, deterministic finite automata (DFA), non-deterministic finite automata (NFA), and their properties. Questions assess understanding of concepts like state transitions, language acceptance, and the equivalence of DFA and NFA. The exam allows 1 hour and 45 minutes for completion.

Uploaded by

anwar kadi
Copyright
© © All Rights Reserved
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
6 views3 pages

Automata and Complexity Theory Mid Term Exam Time Allowed 1:45

The document is a midterm exam for a course on automata and complexity theory, consisting of multiple-choice questions covering topics such as finite automata, deterministic finite automata (DFA), non-deterministic finite automata (NFA), and their properties. Questions assess understanding of concepts like state transitions, language acceptance, and the equivalence of DFA and NFA. The exam allows 1 hour and 45 minutes for completion.

Uploaded by

anwar kadi
Copyright
© © All Rights Reserved
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/ 3

Automata and complexity theory Mid term Exam time allowed 1:45

1. Which of the following is not a part of 5-tuple finite automata?


a. Input alphabet
b. Transition function
c. Initial State
d. Output Alphabet
2. Which of the following statements is true for a DFA?
a. It has multiple start states.
b. It has multiple accept states.
c. It can have epsilon transitions.
d. It has a unique next state for each input symbol.
3. A DFA is called deterministic because:
a. It has a fixed number of states.
b. It can deterministically decide whether to accept or reject a string.
c. It does not accept epsilon transitions.
d. It has multiple transitions for a single input symbol.
4. The language accepted by a DFA is:
a. Context-free.
b. Context-sensitive.
c. Regular.
d. Recursively enumerable.
5. The DFA for the language {w | w contains at least one ‘a’} over the alphabet {a, b} will
have:
a. 2 states
b. 3 states
c. 1 state
d. 4 states
6. A DFA and an NFA are equivalent in the sense that:
a. Both recognize the same set of languages.
b. Both have the same number of states.
c. Both can have epsilon transitions.
d. Both require the same amount of memory.
7. Which of the following is true for an NFA?
a. It has multiple start states.
b. It has multiple transitions for a single input symbol from a given state.
c. It cannot have epsilon transitions.
d. It has a unique next state for each input symbol.
8. Which of the following is not a part of the 5-tuple representation of an NFA?
a. A finite set of states.
b. A finite set of input symbols.
c. A finite set of output symbols.
d. A transition function.
9. An NFA can be converted to:
a. A DFA
b. A PDA
c. A Turing machine
d. None of the above
10. Which statement is correct?
a. All NFAs are DFAs.
b. All NFAs are not DFAs.
c. (both a and b
d. None of these
11. For each symbolic representation of the alphabet, there is only one state transition in?
a. FA
b. NFA
c. DFA
d. All of these
12. Dead state is not required in which of the following?
a. FA
b. NFA
c. DFA
d. All of these
13. The number of transitions required to convert the following into equivalents DFA:

a) 2
b) 3
c) 1
d) 0
14. which of the following string is accepted by the following FA
a. 00000001
b. 010100011
c. 0000111100
d. All

15. which of the following string is rejected by the following FA


A. 011110000
B. 01101101100
C. 011100011101
D. none
16. Construct NFA corresponding to the automata given below

17. Construct a graphical representation corresponding to the automata given below

18. Convert the following NFA into DFA

You might also like