Question Bank FLAT
Question Bank FLAT
Unit 2
Unit 3
Unit-4
1 Draw basic Turing machine model and enlist the elements of the model.
2 Define Turing recognizable (recursively enumerable) and Turing decidable
(recursive) languages.
3 State the formal definition of Turing Machine.
4 Consider the language L = {an bn cn | n>=1} which consists of strings with
equal numbers of aaa's, bbb's, and ccc's. Genrate Context Sensitive grammar
for given language. Also derive the string “aabbcc”.
5 Design a Turing Machine that recognizes words of the form {0n1n for n>= 0.}
6 Design a Turing Machine to find the 2’s Compliment of a given binary number.
7 Design a Turing Machine that recognizes strings containing equal no of 0s and
1s.
8 Design a Turing machine that accepts the language L = {w | w is a
palindrome}.
9 Evaluate whether nondeterministic Turing machines are more powerful than
deterministic Turing machines. Justify your answer.
10 Differentiate recursive and recursively enumerable language.
11 Explain Context-sensitive grammars (CSG) with suitable example.
12 Explain Linear Bounded Automata and all the tuples in LBA with appropriate
example.
13 Construct a simple example of an unrestricted grammar and show how it can
be simulated by a Turing machine.
14 Compare and contrast the behavior of deterministic and nondeterministic
Turing machines. Under what conditions are they equivalent?
Unit-5