Professional Documents
Culture Documents
Automata 1
Automata 1
Automata 1
http://my.safaribooksonline.com/book/software-engineering-and-devel...
This Book
Introduction to Formal Languages, Automata Theory and Computation
Search Contents
Table of Contents Index Copyright About the Authors Preface Acknowledgements Ch. 1. Preliminaries Ch. 2. Grammars Ch. 3. Finite State Automata Ch. 4. Finite State Automata: Characterization, Properties, and Decidability Ch. 5. Finite State Automata with Output and Minimization Ch. 6. Variants of Finite Automata Ch. 7. Pushdown Automata Ch. 8. Context-Free GrammarsProperties and Parsing Ch. 9. Turing Machines Ch. 10. Variations of Turing Machines Ch. 11. Universal Turing Machine and Decidability Ch. 12. Time and Space Complexity Ch. 13. Recent Trends and Applications Ch. 14. New Models of Computation Multiple Choice Questions (Set I) Multiple Choice Questions (Set II) Answers Bibliography Illustrations Index
1.
Consider three decision problems P1, P2 and P3. It is known that P1 is decidable and P2 is undecidable. Which one of the following is TRUE?
time reducible to P3
b. P3 is NP complete if P3 is polynomial time reducible
to P2
c. P3 is NP complete if P2 is reducible to P3 d. P3 has polynomial time complexity and P3 is
reducible to P2
3. Consider the FSA M
two bs}
b. {w {a, b}* | every a in w is followed by atleast
two bs}
c. {w {a, b}* |w contains the substring abb} d. {w {a, b}* |w does not contain aa as substring}
4. Let Nf and Np denote the classes of languages accepted by nondeterministic FSA and nondeterministic PDA, respectively. Let Df and Dp denote the classes of languages accepted by
22-09-2012 00:24
http://my.safaribooksonline.com/book/software-engineering-and-devel...
deterministic FSA and PDA respectively. Which of the following is TRUE? Some of these questions have appeared in GATE examinations.
a. Df Nf
D p Np
D p = Np
b. Df Nf
D p Np
c. Df = Nf
D p = Np
d. Df = Nf
5.
L1 = {anb ncm|n, m > 0} and L2 = {anb mcm|n, m > 0} Which one of the following statements is false? a. L1 L2 is a CFL b. L1 L2 is a CFL c. L1 L2 is inherently ambiguous d. L1 L2 is a CSL
6. Consider the languages
L1 = {anb mcndp|n, m, p > 0} and L2 = {anb mcpdm|n, m, p> 0} Which one of the following statements is false? a. L1 L2 is a CFL b. L1 L2 is a CFL c. L1 L2 is inherently ambiguous d. L1 L2 is a CSL
7. Consider the languages
L1 = {anb mcmdn|n, m > 0} and L2 = {anbncmd m|n, m > 0} Which one of the following statements is false? a. L1 L2 is a CFL b. L1 L2 is a CFL c. L1 and L2 are CFL d. L1 L2 is a CSL
8. Let L and be a language and its complement. Which one of the following possibilities will not hold?
a. L and
recursively enumerable
22-09-2012 00:24
http://my.safaribooksonline.com/book/software-engineering-and-devel...
c. L and d. L and
9.
are not recursively enumerable are recursively enumerable but not recursive
Let L1 be a recursive language and let L2 be a recursively enumerable language which is not recursive. Which one of the following is TRUE?
a. b. c. d.
10.
L1 = {wwR|w {0,1}*} L2 = {wcwR|w {0,1}*} L3 = {ww|w {0,1}*} Which one of the following is TRUE? a. L1 is deterministic CFL b. L2 is deterministic CFL c. L3 is a CFL but not a deterministic CFL d. L3 is deterministic CFL
11. Let S be a NPcomplete problem and Q and R be two other problems not known to be in NP. Q is polynomial time reducible to S and S is polynomial time reducible to R. Which one of the following statements is TRUE?
bn cm|n, m 0}
L2 = {a
n+m
bn + m cm|n, m 0}
L3 = {an + m bn + m cm + n|n, m 0} Which of these languages are not CF. a. L1 only b. L3 only c. L1 and L2 d. L2 and L3
13. If s is a string over (0+1)* then let m0 (s) denote the number of 0s in s and n1 (s) the number of 1s in s. Which one of the following languages is not regular?
n1(s)| 2}
22-09-2012 00:24
http://my.safaribooksonline.com/book/software-engineering-and-devel...
Which one of the following statements is TRUE? a. L is recursively enumerable but not recursive b. L is recursive, but not context-free c. L is context-free, but not regular d. L is regular
15. Let FHAM be the problem of finding a Hamiltonian cycle in a graph G and DHAM be the problem of determining if a Hamiltonial cycle exists in a graph. Which one of the following is TRUE?
a. Both FHAM and DHAM are NP-hard b. FHAM is NP hard, but DHAM is not c. DHAM is NP hard, but FHAM is not d. Neither FHAM nor DHAM is NP hard
16. Consider the following statements about the context-free grammar G = {S SS, S ab, S ba, S c}
bs
III. G can be accepted by a deterministic PDA Which combination below expresses all the true statements about G? a. I only b. I and III only c. II and III only d. I, II and III
17. Let L1 be a regular language and L2 a deterministic CFL. L3 is recursively enumerable but not recursive. Which one of the following statement is FALSE?
a. 3
22-09-2012 00:24
http://my.safaribooksonline.com/book/software-engineering-and-devel...
b. 5 c. 8 d. 9
19. Which one of the following grammars generates the language L = {aibj|i j}.
a. S AC|CB
a. max(l, m) + 2 b. l + m + 2 c. l + m + 3 d. max(l, m) + 3
21. Consider S SS|a. What is the number of different derivation trees for aaaaa
a. 3 b. 5 c. 7 d. 14
22. Which one of the following grammar generates L = {ai bj ck|i k, i, j, k 1}
a. S AC|CB
22-09-2012 00:24
http://my.safaribooksonline.com/book/software-engineering-and-devel...
A bA|bB B cB|c
c. S AB
A aAb|ab B bBc|bc
d. S AC|CB
a. not recursive b. is recursive and is a deterministic CFL c. is a regular language d. is not a deterministic CFL but a CFL
25. Which of the following languages is regular?
a. {wwR|w {0, 1}+} b. {wwRx|w, x {0, 1}+} c. {w x w R|w, x {0, 1}+} d. {xwwR|w, x {0, 1}+}
26. Let = {0, 1}, L1 = * and L2 = {0n 1n|n 1} then the languages L1 L2 and L2 are respectively
a. regular, regular b. regular, not regular c. not regular, regular d. not regular, not regular
27. Which of the following statements is false?
undecidable
b. determining whether a context-free grammar is
ambiguous is un-decidable
22-09-2012 00:24
http://my.safaribooksonline.com/book/software-engineering-and-devel...
i. (00)* (0 + ) ii. (00)* iii. 0* iv. 0(00)* a. (i) and (ii) b. (ii) and (iii) c. (i) and (iii) d. (iii) and (iv)
29. Let L * where = {a, b}. Which of the following is true?
regular
b. L = {an bn | n 1} is regular c. L = {am bn | m, n 1} is regular d. L = {x|x has more as than bs} is regular
30. Define for a CFL L, init (L) = {u | uv L for some v {0, 1}*}. In other words init (L) is the set of prefixes of L. Let L = {w|w {0, 1}+, w has equal number of 0s and 1s}. Then init (L) is
0s and 1s
b. the set of all binary stings including c. the set of all binary strings with exactly one more 0
a. L1L2 b. L1 L2 c. L1 L2 d. L1 R
32. The grammar whose productions are stmt if id then stmt
22-09-2012 00:24
http://my.safaribooksonline.com/book/software-engineering-and-devel...
id a|b|c|d|f is ambiguous because a. the sentence if a then if b then c := d has more than
a. {wbwR|w {a, c}*} b. {wwR|w {a, b, c}*} c. {anbnc n|n 1} d. {w|w is a palindrome over {a, b, c}}
36. Which of the following instances of the post correspondence problem has a viable sequence (a solution)?
a. {(b, bb), (bb, bab), (bab, abb), (abb, babb)} b. {(ab, aba), (baa, aa), (aba, baa)} c. {(ab, abb), (ba, aaa), (aa, a)} d. none of the above
37. It is undecidable, whether
a. an arbitrary TM has 15 states b. an arbitrary TM halts after 10 steps c. an arbitrary TM ever prints a specific letter
22-09-2012 00:24
http://my.safaribooksonline.com/book/software-engineering-and-devel...
a. S R b. R S c. T S d. R T
39. Which one of the following is the strongest correct statement about a finite language L over a finite alphabet ?
a. infinite union of regular sets is regular b. infinite union of finite sets is regular c. finite union of finite sets is regular d. complement of a finite set need not be regular
PREVIEW
Not a subscriber?
22-09-2012 00:24