Scribd
Upload
29 views2 pages

Question Bank

The document is a question bank on the theory of computation, covering topics such as finite automata, regular expressions, and grammar. It includes multiple-choice questions, explanations of concepts, and tasks like constructing machines and defining terms. The questions assess understanding of regular languages, closure properties, and the relationship between different types of grammars and automata.

Uploaded by

Sanika Deshmukh
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
29 views2 pages

Question Bank

The document is a question bank on the theory of computation, covering topics such as finite automata, regular expressions, and grammar. It includes multiple-choice questions, explanations of concepts, and tasks like constructing machines and defining terms. The questions assess understanding of regular languages, closure properties, and the relationship between different types of grammars and automata.

Uploaded by

Sanika Deshmukh
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

Theory of computation

Question Bank
No. Questions
1 The number of final states in the FA can be
i) 1 ii) 2 iii) 3 iv ) All
2 If a FA contain epsilon transition means
i) It must be Non deterministic FA
ii) It must be deterministic FA
iii) It may or may not be non-deterministic FA
iv) None of the above.
3 Explain the following
i) String
ii) Power set
iii) The Kleen star
iv) Prefix and Suffix
v) Reverse of string
4 Construct the following machine with epsilon transition into machine without epsilion
transition.

5 If w is the string of length n characters, then there must exist following substrings.
a) n ( n +1) b) n (n +1)/2 c) n (n +1) / 2 +1 d) None of the above
6 The substring is same as subsequence
a) True b) False
7 Draw and explain the block diagram of finite automata.
8

9 The regular expression (a+b )* indicates


a) All string starting with a and ending with b.
b) All string of any combination of a & b with length zero or more.
c) All string of any combination of a & b with length one or more.
d) All of the above.
10 A language is regular if and only if
a) accepted by DFA
b) accepted by PDA
c) accepted by LBA
d) accepted by Turing machine
11 What is regular expression. Explain in detail.
12 Write the regular expression for the language representing strings in which every 0 is
immediately followed by atleast 2 one’s.
13 A regular expression is notation of language.
a) True b) False
14 Regular grammar is
a) context free grammar b) non context free grammar
c) english grammar d) none of the mentioned
15 What are colsure properties of regular langauges.
16 Obtain the Deterministic Finite Automata for the regular expression
ba + (a + bb)a*b
17 Let the class of language accepted by finite state machine be L1 and the class of languages
represented by regular expressions be L2 then
a) L1<L2 b) L1>=L2 c) L1 U L2 = .* d) L1=L2
18 Regular expression are
a) Type 0 language b) Type 1 language
c) Type 2 language d) Type 3 language
19 Define the following.
i) Context free grammar ii)Parse tree
20 Which of the following is true?
a) Every subset of a regular set is regular
b) Every finite subset of non-regular set is regular
c) The union of two non regular set is not regular
d) Infinite union of finite set is regular
21 Regular expressions are closed under
a) Union b) Intersection c) Kleen star d) All of the mentioned
22 Explain the Ambiguity in grammar.

You might also like