CurrentGK -> Papers -> GAT(Graduate Aptitude Test In Engineering) -> THEORY OF COMPUTATION 6

If you find this context important and usefull. We request to all visitors to sheare this with your friends on social networking channels.## THEORY OF COMPUTATION 6

THEORY OF COMPUTATION 6 ## THEORY OF COMPUTATION 6
And L1={<G,G’,1>|G,G’ are the encodings of cfgs that either one or both do not generate infinite sets}.Let L=L0UL1. Let L’ be the complement of L. Choose the correct statement And L1={<G,G’,1>|G,G’ are the encodings of csgs that either one or both do generate the same set}.Let L=L0UL1. Let L’ be the complement of L. Choose the correct statement And L1={<G,G’,1>|G,G’ are the encodings of unrestricted grammars that either one or both do generate the same set}.Let L=L0UL1. Let L’ be the complement of L. Choose the correct statement And L1={<G,G’,1>|G,G’ are the encodings of linear bounded automata that either one or both do generate the same set}.Let L=L0UL1. Let L’ be the complement of L. Choose the correct statement And L1={<G,G’,1>|G,G’ are the encodings of unrestricted grammars that generate languages L and LR with L not the same as LR respectively}.Let L=L0UL1. Let L’ be the complement of L. Choose the correct statement And L1={<G,G’,1>|G,G’ are the encodings of C programs that do not produce the same output for all inputs}.Let L=L0UL1. Let L’ be the complement of L. Choose the correct statement And L1={<G,G’,1>|G,G’ are the encodings of C programs that do not produce some output for all inputs}.Let L=L0UL1. Let L’ be the complement of L. Choose the correct statement And L1={<G,G’,1>|G,G’ are the encodings of C programs that do not loop on some input}.Let L=L0UL1. Let L’ be the complement of L. Choose the correct statement And L1={<G,G’,1>|G,G’ are the encodings of cfgs where the intersection of the languages generated is not a cfl}.Let L=L0UL1. Let L’ be the complement of L. Choose the correct statement And L1={<G,G’,1>|G,G’ are the encodings of cfs that both or either does not generate a regular set}.Let L=L0UL1. Let L’ be the complement of L. Choose the correct statement And L1={<G,G’,1>|G,G’ are the encodings of cfgs sucht that L(G’) is not contained in L(G)}. Let L=L0UL1. Let L’ be the complement of L. Choose the correct statement And L1={<G,G’,1>|G,G’ are the encodings of C programs that generate languages whose complement is not both a cfl}.Let L=L0UL1. Let L’ be the complement of L. Choose the correct statement And L1={<G,G’,1>|G,G’ are the encodings of unambiguous cfgs}.Let L=L0UL1. Let L’ be the complement of L. Choose the correct statement And L1={<G,G’,1>|G,G’ are the encodings of cfls that are not inherently ambiguous}.Let L=L0UL1. Let L’ be the complement of L. Choose the correct statement L0={<M,M1,0>|M is equivalent to M1} L1={<M,M1,1>| M is not equivalent to M1} Here <M,w,I> is a triplet, whose first component, M is an encoding of a turing machine , second component M1 is the encoding of a nondeterministic linear bounded automaton, and third component I is a bit. Let L=L0 U L1. Which of the following is true? L0={<M,M1,0>|M is equivalent to M1} L1={<M,M1,1>| M is not equivalent to M1} Here <M,w,I> is a triplet, whose first component, M is an encoding of a turing machine , second component M1 is the encoding of a 100 tape nondeterministic turing machine that halts on all inputs, and third component I is a bit. Let L=L0 U L1. Which of the following is true? L0={<M,w,0>|M in the course of its computation visits state w} L1={<M,w,1>| M does not halt visit state w} Here <M,w,I> is a triplet, whose first component, M is an encoding of a nondeterministic 789 pushdown tape machine , second component w, is a state and third component I is a bit. Let L=L0 U L1. Which of the following is true? L0={<M,w,0>|M prints symbol w} L1={<M,w,1>| M never prints symbol w} Here <M,w,I> is a triplet, whose first component, M is an encoding of a nondeterministic 789 pushdown tape machine , second component w, is a symbol and third component I is a bit. Let L=L0 U L1. Which of the following is true? |

## Related Posts

- Civil Engineering Sample Questions 2002
- Gate Electrical Sample Questions
- 2006 Anna University B.E Information Technology GATE Exam Question Paper Question Paper
- Gate Computer Science Engineering Sample Papers
- THEORY OF COMPUTATION
- Gate Electronics & Communication2
- GATE Exam Question Paper Question Paper
- Gate Information Technology 2
- THEORY OF COMPUTATION 4
- Gate Electrical Sample Questions 3

Current Affairs