The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
0 votes

Image may contain: text

asked in Theory of Computation by Boss (49.6k points) | 111 views

1 Answer

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 

answered by Boss (36.4k points)

Related questions

+1 vote
1 answer
asked Apr 29, 2016 in Theory of Computation by Sanjay Sharma Boss (49.6k points) | 97 views

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

42,619 questions
48,614 answers
63,847 users