The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
24 views
Let G1 be a context free grammar and G2 be a regular grammar.Is the problem L(G1) intersection L(G2) =phi decidable?
asked in Theory of Computation by Active (1.4k points) | 24 views

1 Answer

0 votes

as we know that intersection of regular language and cfl is cfl and cfl is closed under emptyness. so yes its DECIDABLE.

answered by Loyal (9.4k points)
0
how u got it?
0
it asks for intersection of regular and cfl = phi ?

and we know that intersection of reg and cfl is cfl. and cfl is closed under emptyness so it is decidable.


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

41,073 questions
47,669 answers
147,410 comments
62,387 users