371 views
0 votes
0 votes
hello,

i’ve just solved 2 questions among many, but i’m not sure i’ve got to the right result. could you check if i did it correctly(especially 2) as it’s more complicated). both are over $\Sigma = \{a,b,c\}$
 

1)$ L=\bigg\{w\in \sum^*\bigg| w\quad \text{starts and ends with} \quad aa\bigg\}$

the equivalence classes $R_L$ i found are:

$S_1 = \epsilon$

$S_2 = a$

$S_3 = (b+c)\sum^*+a(b+c)\sum^*$

$S_4 = aa+aaa+aa\sum^*aa$

$S_5 = aa\sum^*(b+c)a$

$S_6 = aa\sum^*(b+c)$

2)$L=\{\sum^*-(\{\epsilon, a,b\}\cup \{bba^i|i\ge 0\})\}$ ( more tricky)

after joining the sets i got that $\{\epsilon, a,b\}\cup \{bba^i|i\ge 0\}=\{\epsilon, a,b,bba^*\}$, so the equivalence classes are:

$S_1 = \epsilon$

$S_2 = a$

$S_3 = b$

$S_4 = bba*$

$S_5 = c\Sigma^*+a\Sigma^++b(a+c)\Sigma^*+bb\Sigma^*(b+c)\Sigma^*$

one thing i don’t know how to do is how to find the separating words between the equivalence classes. could you help me with that please?

thank you very much for your help, really hoping i did it correctly.

Please log in or register to answer this question.

Related questions

7 votes
7 votes
2 answers
1
resuscitate asked Dec 5, 2015
12,025 views
The number of equivalence classes which exist for the following regular expression R are ______. $R=(a+b)^*b(a+b+\epsilon )$ what is the meaning of equivale...
1 votes
1 votes
1 answer
2
Parshu gate asked Nov 27, 2017
1,340 views
Consider a regular language L over Σ={0,1} such that L contains every string which ends with "0". The number of equivalence classes in L is ______.
0 votes
0 votes
1 answer
3
jhaanuj2108 asked Sep 26, 2018
697 views
Consider the following DFA: The number of distinct sets present in all partitions while converting given DFA into minimal DFA using Myhill-Nerode theorem is ________.
4 votes
4 votes
2 answers
4
praj asked Aug 18, 2015
4,424 views
Find all the equivalence classes of Regular Language011 (0+1)* 011