Register

regular expression

396 views

1 Answer

Voting & Accepting an answer helps improve the community
← Previous · rosen excerciseNext → · bsnl form
← Previous in category · Peter Linz-Chapter 3...Next in category → · Peter Linz-Chapter 3...
Position:
Show:

Related questions

3 3 votes
2 2 answers
289
289 views
GO Classes asked Oct 23, 2025
289 views
GO Classes DPP | TOC|REGULAR EXPRESSION
Consider the following three regular expressions over the alphabet $\Sigma=\{0,1\}$ :$p=\left(1^* 01^* 0\right)^* 1^*$ $q=\left(0^* 10^* 1\right)^* 0^*$ $r=((0+1)(0+1))^*...
3 3 votes
1 1 answer
316
316 views
GO Classes asked Oct 23, 2025
316 views
GO Classes DPP | TOC|REGULAR EXPRESSION
Let $\mathrm{p}, \mathrm{q}$, and r be three regular expressions over the alphabet $\Sigma=\{a, b\}$.$p=a(a+b)^* b$ $q=(a+b)^* a b(a+b)^*$ $r=a a^* b b^*$Which of the fol...
0 0 votes
1 1 answer
339
339 views
Abhishek_Panthi asked Aug 14, 2025
339 views
For the regular expression R = (a*(bba*)*bbab*)* the minimal DFA has a certain number of final and non-final states (excluding any dead states, if any). Find the difference (Final − Non-final). A) -1 B) 0 C) 1 D) 2