The Gateway to Computer Science Excellence
0 votes
47 views
L is regular <=> there exists a linear grammar for L.

Which way is it true and which way is it false?

Please explain in detail
in Theory of Computation by (195 points) | 47 views
0
The biconditional is true. (which means it correct both ways)

1 Answer

0 votes

https://gateoverflow.in/303591/cfg-doubt

and more over if

Let     L is:   A-> a   (RG)  and also Linear G

and S-> aSb | epsilon (which is linear. But for it we can't drive any RG)

 

  

by Active (1.5k points)
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
50,737 questions
57,354 answers
198,478 comments
105,248 users