1. Assume the R is a relation on a set A, aRb is partially ordered such that a and b are _____________?
- reflexive
- transitive
- symmetric
- reflexive and transitive
L= {xÏµ∑*|x is a string combination}
∑4 represents which among the following?
∑4 represents which among the following?
- {aa, ab, ba, bb}
- {aaaa, abab, Îµ, abaa, aabb}
- {aaa, aab, aba, bbb}
- All of the mentioned
3. A regular language over an alphabet ∑ is one that cannot be obtained from the basic languages using the operation
- Union
- Concatenation
- Kleene*
- All of the above
4. Statement 1: A Finite automata can be represented graphically; Statement 2: The nodes can be its states; Statement 3: The edges or arcs can be used for transitions
Hint: Nodes and Edges are for trees and forests too.
Which of the following make the correct combination?
Hint: Nodes and Edges are for trees and forests too.
Which of the following make the correct combination?
- Statement 1 is false but Statement 2 and 3 are correct
- Statement 1 and 2 are correct while 3 is wrong
- None of the mentioned statements are correct
- All of the mentioned
5. The minimum number of states required to recognize an octal number divisible by 3 are/is
- 1
- 3
- 5
- 7
6. Which of the following is a not a part of 5-tuple finite automata?
- Input alphabet
- Transition function
- Initial State
- Output Alphabet
7. If an Infinite language is passed to Machine M, the subsidiary which gives a finite solution to the infinite input tape is ______________
- Compiler
- Interpreter
- Loader and Linkers
- None of the mentioned
8. The number of elements in the set for the Language L={xÏµ(∑r) *|length if x is at most 2} and ∑={0,1} is_________
- 7
- 6
- 8
- 5
9. For the following change of state in FA, which of the following codes is an incorrect option?
- Î´ (m, 1) =n
- Î´ (0, n) =m
- Î´ (m,0) =Îµ
- s: accept = false; cin >> char; if char = “0” goto n;
10. The non- Kleene Star operation accepts the following string of finite length over set A = {0,1} | where string s contains even number of 0 and 1
- 01,0011,010101
- 0011,11001100
- Îµ,0011,11001100
- Îµ,0011,11001100
0 Comments