UGC NET Computer Science(Theory of Computation) Online Test

The language accepted by finite automata is


Which of the following statements is correct ?


Which of the following words are accepted by the PDA P ?


which of following applications regular expressions can no tbe used.


Can a DFSA simulate a NFSA


The concept of FSA is much used in this part of the compiler


The concept of grammar is much used in this part of the compiler


A language L is accepted by a FSA iff it is


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 statement are TRUE ?


The following grammar

G = (N, T, P, S)

N = {S, A, B}

T = {a, b, c}

P : S --> aSa

S --> aAa

A --> bB

B --> bB

B -->c is

















































Description:

Theory of computation is important for UGC NET /JRF



Discussion

Preet Singh

plz more practice test for ugc net computer sci paper 2 and 3

2143 days 5 hours 9 minutes ago

Ashok Shakya
UGC NET/JRF COMPUTER SCIENCE
User
4 Followers
Test: 1

Your Facebook Friends on WizIQ