Register

#TOC

60 views

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
3
M_Umair_Khan42900 asked Dec 29, 2022
796 views
Show that the following pairs of regular expressions define the same language over the alphabet I = [a, b]. s(a) p(pp)*( A + p)q + q and p*q (b) A +0(0+1)* + (0+1)* 00(0+1)* and ((1*0)*01*)* (c) (s*ttt)*s* and s*(ttts*)*
Show that the following pairs of regular expressions define the same language over the alphabet I = [a, b].s(a) p(pp)*( A + p)q + q and p*q(b) A +0(0+1)* + (0+1)* 00(0+1)...
User Avatar
2 votes
2 votes
3 answers
4
coder97 asked Oct 5, 2021
706 views
Regular expressons
The minimum number of states in an equivalent finite automata for the given regular expression are _____ (a(a(a(a(a(ab)*b)*b)*b)*b)*b)*
The minimum number of states in an equivalent finite automata for the given regular expression are _____(a(a(a(a(a(ab)*b)*b)*b)*b)*b)*
User Avatar
Link Copied!