Register

UGC NET CSE | July 2018 | Part 2 | Question: 34

• recategorized by
3,273 views

3 Answers

0 votes
0 votes

we know that

Regular grammar generates Regular Language ===> Accepted by Finite Automata.

CFG generates CFL ====> Accepted by PDA

 

but PDA = FA + 1 - Auxiliary Memory  = FA+stack

therefore if you are not using the memory of PDA it simply looks as FA.

 

∴ PDA can recognize the language which is generates by either CFG or RG 

User Avatar
0 votes
0 votes

Option C

Turing Machine recognises ALL
Linear Bounded Automata  recognises CSL , CFL , RL
Push down automata recognises CFL , RL
Finite Automata recognises only RL
 

User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
6 answers
1
Pooja Khatri asked Jul 13, 2018
2,432 views
UGC NET CSE | July 2018 | Part 2 | Question: 33
A pushdown automata behaves like a Turing machine when the number of auxiliary memory is 0 1 1 or more 2 or more
A pushdown automata behaves like a Turing machine when the number of auxiliary memory is011 or more2 or more
User Avatar
1 votes
1 votes
2 answers
2
Pooja Khatri asked Jul 13, 2018
15,333 views
UGC NET CSE | July 2018 | Part 2 | Question: 31
Two finite state machines are said to be equivalent if they: Have the same number of edges Have the same number of states Recognize the same set of tokens Have the same number of states and edges
Two finite state machines are said to be equivalent if they:Have the same number of edgesHave the same number of statesRecognize the same set of tokensHave the same numbe...
User Avatar
0 votes
0 votes
2 answers
3
Pooja Khatri asked Jul 13, 2018
6,836 views
UGC NET CSE | July 2018 | Part 2 | Question: 32
The finite state machine given in figure below recognizes: anu string of odd number of a's anu string of odd number of b's any string of even number of a's and odd number of b's any string of odd number of a's and odd number of b's
The finite state machine given in figure below recognizes:anu string of odd number of a'sanu string of odd number of b'sany string of even number of a's and odd number of...
User Avatar
0 votes
0 votes
1 answer
4
Pooja Khatri asked Jul 13, 2018
1,271 views
UGC NET CSE | July 2018 | Part 2 | Question: 35
To obtain a string of n Terminals from a given Chomsky normal from grammar, the number of productions to be used is $2n-1$ $2n$ $n+1$ $n^2$
To obtain a string of n Terminals from a given Chomsky normal from grammar, the number of productions to be used is$2n-1$$2n$$n+1$$n^2$
User Avatar
Link Copied!