Regular expression: Difference between $emptyset$-concate and $lambda$-concate?
Clash Royale CLAN TAG#URR8PPP
up vote
0
down vote
favorite
Given the definition below, is that the concatenation $emptyset A$ the same as
$lambda A,$ given $A$ a regular expression? If not, what's the difference? My guess is that if I take concatenation $AB$ as Cartesian product $Atimes B,$ then suppose $A=0,1, emptyset A=emptyset$ but $lambda A=A$. Is this correct?
automata regular-language regular-expressions
add a comment |Â
up vote
0
down vote
favorite
Given the definition below, is that the concatenation $emptyset A$ the same as
$lambda A,$ given $A$ a regular expression? If not, what's the difference? My guess is that if I take concatenation $AB$ as Cartesian product $Atimes B,$ then suppose $A=0,1, emptyset A=emptyset$ but $lambda A=A$. Is this correct?
automata regular-language regular-expressions
The concatenation of sets is a set of concatenations of elements $AB=ab: ain A wedge bin B$, not pairs. For example for sets $A=a, aa$, $B=b, ab$ we have $AB=ab, aab, aaab$, while $Atimes B = (a,b),(a,ab),(aa,b),(aa,ab)$ (note, that $|AB|=3$, but $|Atimes B|=4$)
â Jaroslaw Matlak
Jul 16 at 16:33
@JaroslawMatlak: You're right I'm wrong, but is that $emptyset A=emptyset$? Since there are nothing to choose to concatenate?
â Nong
Jul 16 at 16:35
1
According to this definition - yes.
â Jaroslaw Matlak
Jul 16 at 16:35
add a comment |Â
up vote
0
down vote
favorite
up vote
0
down vote
favorite
Given the definition below, is that the concatenation $emptyset A$ the same as
$lambda A,$ given $A$ a regular expression? If not, what's the difference? My guess is that if I take concatenation $AB$ as Cartesian product $Atimes B,$ then suppose $A=0,1, emptyset A=emptyset$ but $lambda A=A$. Is this correct?
automata regular-language regular-expressions
Given the definition below, is that the concatenation $emptyset A$ the same as
$lambda A,$ given $A$ a regular expression? If not, what's the difference? My guess is that if I take concatenation $AB$ as Cartesian product $Atimes B,$ then suppose $A=0,1, emptyset A=emptyset$ but $lambda A=A$. Is this correct?
automata regular-language regular-expressions
edited Jul 16 at 16:19
asked Jul 16 at 16:10
Nong
1,1471520
1,1471520
The concatenation of sets is a set of concatenations of elements $AB=ab: ain A wedge bin B$, not pairs. For example for sets $A=a, aa$, $B=b, ab$ we have $AB=ab, aab, aaab$, while $Atimes B = (a,b),(a,ab),(aa,b),(aa,ab)$ (note, that $|AB|=3$, but $|Atimes B|=4$)
â Jaroslaw Matlak
Jul 16 at 16:33
@JaroslawMatlak: You're right I'm wrong, but is that $emptyset A=emptyset$? Since there are nothing to choose to concatenate?
â Nong
Jul 16 at 16:35
1
According to this definition - yes.
â Jaroslaw Matlak
Jul 16 at 16:35
add a comment |Â
The concatenation of sets is a set of concatenations of elements $AB=ab: ain A wedge bin B$, not pairs. For example for sets $A=a, aa$, $B=b, ab$ we have $AB=ab, aab, aaab$, while $Atimes B = (a,b),(a,ab),(aa,b),(aa,ab)$ (note, that $|AB|=3$, but $|Atimes B|=4$)
â Jaroslaw Matlak
Jul 16 at 16:33
@JaroslawMatlak: You're right I'm wrong, but is that $emptyset A=emptyset$? Since there are nothing to choose to concatenate?
â Nong
Jul 16 at 16:35
1
According to this definition - yes.
â Jaroslaw Matlak
Jul 16 at 16:35
The concatenation of sets is a set of concatenations of elements $AB=ab: ain A wedge bin B$, not pairs. For example for sets $A=a, aa$, $B=b, ab$ we have $AB=ab, aab, aaab$, while $Atimes B = (a,b),(a,ab),(aa,b),(aa,ab)$ (note, that $|AB|=3$, but $|Atimes B|=4$)
â Jaroslaw Matlak
Jul 16 at 16:33
The concatenation of sets is a set of concatenations of elements $AB=ab: ain A wedge bin B$, not pairs. For example for sets $A=a, aa$, $B=b, ab$ we have $AB=ab, aab, aaab$, while $Atimes B = (a,b),(a,ab),(aa,b),(aa,ab)$ (note, that $|AB|=3$, but $|Atimes B|=4$)
â Jaroslaw Matlak
Jul 16 at 16:33
@JaroslawMatlak: You're right I'm wrong, but is that $emptyset A=emptyset$? Since there are nothing to choose to concatenate?
â Nong
Jul 16 at 16:35
@JaroslawMatlak: You're right I'm wrong, but is that $emptyset A=emptyset$? Since there are nothing to choose to concatenate?
â Nong
Jul 16 at 16:35
1
1
According to this definition - yes.
â Jaroslaw Matlak
Jul 16 at 16:35
According to this definition - yes.
â Jaroslaw Matlak
Jul 16 at 16:35
add a comment |Â
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2853552%2fregular-expression-difference-between-emptyset-concate-and-lambda-concate%23new-answer', 'question_page');
);
Post as a guest
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
The concatenation of sets is a set of concatenations of elements $AB=ab: ain A wedge bin B$, not pairs. For example for sets $A=a, aa$, $B=b, ab$ we have $AB=ab, aab, aaab$, while $Atimes B = (a,b),(a,ab),(aa,b),(aa,ab)$ (note, that $|AB|=3$, but $|Atimes B|=4$)
â Jaroslaw Matlak
Jul 16 at 16:33
@JaroslawMatlak: You're right I'm wrong, but is that $emptyset A=emptyset$? Since there are nothing to choose to concatenate?
â Nong
Jul 16 at 16:35
1
According to this definition - yes.
â Jaroslaw Matlak
Jul 16 at 16:35