search
Log In
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
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.

Recent questions tagged regular-grammar

0 votes
0 answers 7 views
if language is finite then dfa possible irrespective of comparison between symbols exist or not.is it true??
asked Jun 8 in Theory of Computation promise 5 points 7 views
0 votes
1 answer 33 views
Hi, I do not succeed in this question: Need to construct a right-linear grammar Would appreciate help :)
asked May 10 in Algorithms eden 5 points 33 views
0 votes
2 answers 79 views
0 votes
0 answers 13 views
Consider the alphabet $\Sigma = \{0, 1\}$, the null/empty string $\lambda$ and the set of strings $X_0, X_1, \text{ and } X_2$ generated by the corresponding non-terminals of a regular grammar. $X_0, X_1, \text{ and } X_2$ are related as follows. $X_0 = 1 X_1$ $X_1 = 0 X_1 + 1 X_2$ ... in $X_0$? $10(0^*+(10)^*)1$ $10(0^*+(10)^*)^*1$ $1(0+10)^*1$ $10(0+10)^*1 +110(0+10)^*1$
asked Apr 18, 2020 in Theory of Computation admin 573 points 13 views
0 votes
0 answers 8 views
Consider the regular grammar below $S \rightarrow bS \mid aA \mid \epsilon $ $A \rightarrow aS \mid bA$ The Myhill-Nerode equivalence classes for the language generated by the grammar are $\{w \in (a + b)^* \mid \#a(w) \text{ is even) and} \{w \in (a + b)^* \mid \#a(w) \text{ is odd}\}$ ... $\{\epsilon\},\{wa \mid w \in (a + b)^* \text{and} \{wb \mid w \in (a + b)^*\}$
asked Apr 18, 2020 in Theory of Computation admin 573 points 8 views
0 votes
0 answers 10 views
Is the language generated by the grammar $G$ regular? If so, give a regular expression for it, else prove otherwise G: $S \rightarrow aB$ $B \rightarrow bC$ $C \rightarrow xB$ $C \rightarrow c$
asked Apr 18, 2020 in Theory of Computation admin 573 points 10 views
0 votes
0 answers 42 views
Can a regular grammar be ambiguous? If so then plz give some example.
asked Dec 6, 2019 in Theory of Computation Shubhm 9 points 42 views
0 votes
2 answers 42 views
0 votes
1 answer 90 views
Which of the following grammars produce regular languages? A → (A)/ε A → (A(/ε A → (B)/(BB) B → (CC)/(CCC) C → (DDD) D → () A→ aA/b A→ Aa/b A→ aaAb/ε A→ AAaab/ε A→ AAaab/aab
asked Aug 9, 2019 in Theory of Computation Sambhrant Maurya 493 points 90 views
To see more, click for the full list of questions or popular tags.
...