• retagged by
6,334 views
0 0 votes

1 Answer

0 0 votes

(a,b)* is actually you have written in “easier to write for self understanding“ notation type way of representing “reg Language “ in which comma is understood as union ,although it is generally not seen in ToC and programming . A “union” can be represented using square brackets “[]”  like [a-z] or using 
$\cup$ or using “+”  like (a+b) , according to the use and the convention.
in regex, whereas “,” is just a comma

[a-z] a very famous regex (programming) , means at-least 1 literal from “a or b or or ….z” ,which is quite similar to (a+b+...+z) in ToC

A reg language can be represented in Grammar form or DFA or NFA or e-NFA or in Regex .


Now in terms of ToC, 

(a+b)* means any number of times either a or b or nothing :  $\epsilon$ , a , aa… , aaa...b  ,  b , bb , bbb …… , bbb…..a , ab ,ba , aa..b… , b...aa…. , likewise
(a*b*)* means any number of times a , followed by any number of times b  : a , aa… , aaa...b  ,  b , bb , bbb …… , bbb…..a , ab , but not ba or b...a…

{a,b}*  , means language(or universal language)  over the set of alphabets {a,b} , ={ $\epsilon$ , a , aa… , aaa...b  ,  b , bb , bbb …… , bbb…..a , ab ,ba , aa..b… , b...aa…. } = $\Sigma^1$ $\cup$ $\Sigma^2$ $\cup$ $\Sigma^3$ $\cup$... $\Sigma^5$ $\cup$ ….

Check the brackets and the operators carefully.
(a+b)* $\neq$ (a*b*) $\neq$ {a,b}*
but ,

(a*b*) $\subset$ (a+b)* $\subset$ {a,b}*

Also , (a*b*)  $\neq$ (a*b*)*  , but (a*b*) $\subset$ (a*b*)*

also , (a+b)*  =  (a*b*)*

• edited by
Position:
Show:

Related questions

0 0 votes
1 1 answer
640
640 views
upasesharanesh asked Apr 6, 2023
640 views
Write input set, strings and language for the following 1) The set of all strings with three consecutive O's over (0,1) .
0 0 votes
2 2 answers
290
290 views
Shubham Sharma 2 asked Sep 9, 2025
290 views
Which of the following is not a palindromic subsequence of the string "$\text{ababcdabba}$"?$\text{abcba}$$\text{abba}$$\text{abbbba}$$\text{adba}$
0 0 votes
1 1 answer
570
570 views
admin asked May 20, 2023
570 views
In the $\varepsilon$-NFA, $M=\left(\left\{\mathrm{q}_{0}, \mathrm{q}_{1}, \mathrm{q}_{2}, \mathrm{q}_{3}\right\},\{\mathrm{a}\}, \delta, \mathrm{q}_{0},\left\{\mathrm{q}_...
0 0 votes
1 1 answer
1.3k
1.3k views
M_Umair_Khan42900 asked Dec 29, 2022
1,259 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)...