Automata

Set-15 TOC GATE 2006

TOC |Gate-2007| Previous Year Questions| Set-14

TOC |Gate-2007| Theory of Computation ( Automata) Which of the following problems is undecidable?  [GATE – 2007] a. Membership problem for CFGs.b. Ambiguity problem for CFGs.c. Finiteness problem for FSAs.d. Equivalence problem for FSAs. Answer : b) Which of the following is TRUE?  [GATE – 2007] a. Every subset of a regular set is regular.b. …

TOC |Gate-2007| Previous Year Questions| Set-14 Read More »

Set-15 TOC GATE 2006

TOC |Gate-2008| Previous Year Questions| Set-13

TOC |Gate-2008| Theory of Computation ( Automata) Which of the following is true for the language {ap|p is a prime} ?  [GATE – 2008] a. It is not accepted by a Turing Machineb. It is regular but not context-freec. It is context-free but not regulard. It is neither regular nor context-free, but accepted by a Turing machine Answer …

TOC |Gate-2008| Previous Year Questions| Set-13 Read More »