1) abaabaaabaa 2) aaaabaaaa 3) baaaaabaaaab 4) baaaaabaa
_____________________________________________________________________________________ |
||||||||
2. Push down machine represents
_____________________________________________________________________________________ |
||||||||
3. The behavior of a NFA can be stimulated by DFA
|
||||||||
4. Which of the following is not primitive recursive but partially recursive?
_____________________________________________________________________________________ |
||||||||
5. Consider the following grammar. S ::= AB A ::= a A ::= BaB B ::= bbA Which of the following is false?
_____________________________________________________________________________________ |
||||||||
6. Set of regular languages over a given alphabet set,is not closed under
_____________________________________________________________________________________ |
||||||||
7. Consider the regular expression (a + b) (a + b) … (a + b) (n-times). The minimum number of states in finite automaton that recognizes the language represented by this regular expression contains
_____________________________________________________________________________________ |
||||||||
8. The logic of pumping lemma is a good example of | ||||||||
_____________________________________________________________________________________ |
||||||||
9. If every string of a language can be determined whether it is legal or illegal in finite time the language is called
_____________________________________________________________________________________ |
||||||||
10. Context free language can be recognized by
_____________________________________________________________________________________ |
||||||||
11. Fred created a new automaton model which is a push down automaton but with two stacks and the added ability of having commands which do not read input tape but which can pop from one stack and push into the other.This new automaton can recognize (choose strongest result)
_____________________________________________________________________________________ |
||||||||
12. Given the following productions of a grammar :
_____________________________________________________________________________________ |
||||||||
13. FSM can recognize
_____________________________________________________________________________________ |
||||||||
14. Assume statements S1 and S2 defined as : S1 : L2-L1 is recursive enumerable where L1 and L2 are recursive and recursive enumerable respectively. S2 : The set of all Turing machines is countable. Which of the following is true ?
_____________________________________________________________________________________ |
||||||||
15. Which of the following is the most general phase structured grammar ?
_____________________________________________________________________________________ |
||||||||
16. A FSM can be used to add how many given integers?
_____________________________________________________________________________________ |
||||||||
17. Consider the following statements : I. Recursive languages are closed under complementation. II. Recursively enumerable languages are closed under union. III. Recursively enumerable languages are closed under complementation. Which of the above statements are true ?
_____________________________________________________________________________________ |
||||||||
18. 6 Files F1,F2,F3,F4,F5 and F6 have 100,200,50,80,120,150 records repectively.
In what order should they be sorted so as to optimize activity? Assume each file is accessed with the same frequency.
_____________________________________________________________________________________ |
||||||||
19. Following grammar
S-> bS S -> b S -> aA A -> bA
_____________________________________________________________________________________ |
||||||||
20. Which of the following problems are decidable? 1) Does a given program ever produce an output? 2) If L is context-free language, then, is ~L also context-free? 3) If L is regular language, then, is ~L also regular? 4) If L is recursive language, then, is ~L also recursive?
_____________________________________________________________________________________ |
||||||||
21. The language L={ak bk|k>=1} is
_____________________________________________________________________________________ |
||||||||
22. All strings having equal number of a and b can be recognized by
_____________________________________________________________________________________ |
||||||||
23. The basic limitation of a FSM is that
_____________________________________________________________________________________ |
||||||||
24. How many states can a process be in ?
_____________________________________________________________________________________ |
||||||||
25. Which one of the following statement is false ?
_____________________________________________________________________________________ |
||||||||
26. Given the language L = {ab, aa, baa}, which of the following strings are in L*? 1) abaabaaabaa 2) aaaabaaaa 3) baaaaabaaaab 4) baaaaabaa
_____________________________________________________________________________________ |
||||||||
27. Which is not the correct statement(s) ? (i) Every context sensitive language is recursive. (ii) There is a recursive language that is not context sensitive.
_____________________________________________________________________________________ |
||||||||
28. A formal grammar is a___________for rewriting strings.
_____________________________________________________________________________________ |
||||||||
29. Finite automata are used for pattern matching in text editors for
_____________________________________________________________________________________ |
||||||||
30.Two finite states are equivalent if they
_____________________________________________________________________________________ |
||||||||
31. A PDM behaves like a TM when the number of auxiliary memory it has is
_____________________________________________________________________________________ |
||||||||
32. Which of the following permanent database that has an entry for each terminal symbol ?
_____________________________________________________________________________________ |
||||||||
33. The language accepted by finite automata is
_____________________________________________________________________________________ |
||||||||
34. The following CFG S®aB|bA, A®a|as|bAA, B®b|bs|aBB generates strings of terminals that have
_____________________________________________________________________________________ |
||||||||
35. An FSM can be used to add two given integers.This remark is
_____________________________________________________________________________________ |
||||||||
36. Context free languages are not closed under
_____________________________________________________________________________________ |
||||||||
37. Which of the following is most powerful? | ||||||||
_____________________________________________________________________________________ |
||||||||
38. Which of the following statements is/are FALSE? (1) For every non-deterministic Turing machine, there exists an equivalent deterministic Turing machine. (2) Turing recognizable languages are closed under union and complementation. (3) Turing decidable languages are closed under intersection and complementation (4) Turing recognizable languages are closed under union and intersection.
_____________________________________________________________________________________ |
||||||||
|
||||||||
39. Finite state machine___________recognize palindromes.
_____________________________________________________________________________________ |
||||||||
40. Given L1=L(a*baa*) and L2=L(ab*). The regular expression corresponding to language L3 = L1/L2 (right quotient) is given by
_____________________________________________________________________________________ |
||||||||
41. If two finite state machines are equivalent they should have the same number of
|