Recent questions tagged regular-grammar

1 1 vote
1 1 answer
171
171 views
Let $G$ have start symbol $q_0$ and productions :$$\begin{aligned}q_0 &\to \epsilon \mid abq_0 \mid cq_1\\q_1 &\to ab\end{aligned}$$Which regular expression denotes $L(G)...
1 1 vote
1 1 answer
113
113 views
Which of the following statements are always true?Every language generated by a regular grammar is regular. Every regular language can be generated by a regular grammar. ...
1 1 vote
1 1 answer
93
93 views
Consider the grammar with start variable $A$ and productions :$$\begin{aligned}A &\to aB \mid bA \\B &\to bA \mid aC \mid a \\C &\to bA \mid aC \mid a\end{aligned}$$Which...
0 0 votes
1 answers 1 answer
93
93 views
How to get the answer of "The complement of a non regular is regular or non regular " ??
1 1 vote
0 0 answers
85
85 views
Match the LIST-I with LIST-IILIST-IGrammarLIST-IIAll productions are the formA.Regular GrammarI.$\mathrm{A} \rightarrow \mathrm{aX}$, where $\mathrm{a} \in \mathrm{T}$ an...
0 0 votes
2 2 answers
334
334 views
Match the $\textbf{LIST-I}$ with $\textbf{LIST-II}$$\begin{array}{|l|l|l|l|} \hline & \textbf{ LIST-I } & & \textbf{ LIST-II } \\ \hline \text{A.} & \text{Type} - 0 \text...
0 0 votes
0 0 answers
264
264 views
A machine is represented by states $Q$ , input alphabet $\sum$, transition function $\hat{\mathrm{o}}$. Initial state $\mathrm{q}_{0}$ and final state $F$. The machine ac...
0 0 votes
0 0 answers
203
203 views
Which of the following properties correctly describe a Regular Grammar?All production rules are of the form $\mathrm{A} \rightarrow x \mathrm{~B}$ or $\mathrm{A} \rightar...
0 0 votes
0 0 answers
176
176 views
Consider the following grammars:How many of the following statements are not TRUE?Grammar $\text{G}1$ can generate any string that $\text{G}2$ can, $\&$ Grammar $\text{G}...
1 1 vote
4 answers 4 answers
1.4k
1.4k views
0 0 votes
2 answers 2 answers
936
936 views
1 1 vote
1 answers 1 answer
799
799 views
0 0 votes
1 answers 1 answer
385
385 views
0 0 votes
1 answers 1 answer
524
524 views
0 0 votes
1 answers 1 answer
337
337 views
0 0 votes
1 1 answer
457
457 views
Find the equivalent of the Regular Expression:$L_1 = a^* + b^*$ and $L_2 = a^*b^*.$ Which of the following is True?A. $L_1 = L_2$B. $L_1 \cup L_2 = (a + b)^*$C. ${L_{1}}^...
0 0 votes
1 answers 1 answer
584
584 views
0 0 votes
1 answers 1 answer
341
341 views
0 0 votes
1 answers 1 answer
368
368 views
0 0 votes
0 0 answers
335
335 views
I have a doubt in ardens theorem problem A=Ba+AbB=Aa+BbAssume B is final state Hence By ardens theorem A becomes A=Bab* .Hence B=Aa+Bb = Bab*a+BbTherefore B=B(ab*a+b) is ...
0 0 votes
1 1 answer
620
620 views
0 0 votes
1 1 answer
912
912 views
0 0 votes
0 0 answers
1.0k
1.0k views
Identify the type of the given language and draw the corresponding automata for the language.$L=\left \{a^{i}b^{j}c^{k} \space\ | \space\ j=max(i,k) \right \}$A] RegularB...
2 2 votes
2 answers 2 answers
2.4k
2.4k views
Let r1=(0+1)*, r2=0*1+10*+0*+1*. What is the length of the smallest string that is present in language corresponds to regular expression r1 and not present in language co...
2 2 votes
2 answers 2 answers
7.6k
7.6k views
A->aB/bA/bB->aC/bBC->aA/bC/a If the above regular grammar is converted into DFA then how many final states will be there?According to me there should be 2 final states: A...
0 0 votes
0 0 answers
357
357 views