0 votes 0 votes consider following grammer S → aSb / aSbb / aSbbb / ….. is language generated by above grammer is DCFL? Theory of Computation grammar context-free-language dcfl context-free-grammar + – Rahul_Rathod_ asked Dec 24, 2018 Rahul_Rathod_ 572 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply Verma Ashish commented Dec 24, 2018 reply Follow Share When these productions terminate? $S\rightarrow\epsilon$ is given or not? 0 votes 0 votes Shaik Masthan commented Dec 24, 2018 reply Follow Share 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 2 votes 2 votes Please log in or register to add a comment.
0 votes 0 votes It is a dcfl ...no of a’s are equal to or more tham no of b’s Psy Duck answered Oct 16, 2022 Psy Duck comment Share Follow See all 0 reply Please log in or register to add a comment.
