The Gateway to Computer Science Excellence
0 votes
69 views

consider following grammer

S → aSb / aSbb / aSbbb / …..

is language generated by above grammer is DCFL?

 

in Theory of Computation by (425 points) | 69 views
0
When these productions terminate?

$S\rightarrow\epsilon$  is given or not?
+1

i hope S → ϵ is given,

L = { $a^n . b^m\; |\; n ≤ m $ } ===> it have DPDA ==> it is DCFL

otherwise Language generated by the grammar is ∅ ==> RL ==> DCFL

Please log in or register to answer this question.

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
50,666 questions
56,157 answers
193,767 comments
93,752 users