The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
0 votes
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
asked in Theory of Computation by (189 points) | 45 views
The biconditional is true. (which means it correct both ways)

1 Answer

0 votes

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)



answered by (443 points)

Related questions

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
49,811 questions
54,540 answers
75,605 users