Give an example of a language $L$ where $min(max L)neq max(min L)$
$begingroup$
Give an example of a language $L$ where $min(max L)neq max(min L)$.
I thought of the following language $L={a,bc, abc}$.
$$
min L={a,bc}, max L = {abc}
$$
Then:
$$
min(max L)=min ({abc})={abc}neq max(min L)=max({a,bc})={a,bc}
$$
This seems too simple so I'm wondering if it's correct.
The definitions of $max, min$:
$$
min L= {x|xin L land text{there doesn't exist a non-empty substring }y text{ of } x text{ such that } yin L }\
max L = {x|xin L land lnot exists y: xyin L, yneq epsilon}
$$
proof-verification formal-languages
$endgroup$
add a comment |
$begingroup$
Give an example of a language $L$ where $min(max L)neq max(min L)$.
I thought of the following language $L={a,bc, abc}$.
$$
min L={a,bc}, max L = {abc}
$$
Then:
$$
min(max L)=min ({abc})={abc}neq max(min L)=max({a,bc})={a,bc}
$$
This seems too simple so I'm wondering if it's correct.
The definitions of $max, min$:
$$
min L= {x|xin L land text{there doesn't exist a non-empty substring }y text{ of } x text{ such that } yin L }\
max L = {x|xin L land lnot exists y: xyin L, yneq epsilon}
$$
proof-verification formal-languages
$endgroup$
$begingroup$
min and max of a language are not standard operations. You should provide their definitions.
$endgroup$
– Peter Leupold
Jan 28 at 12:33
add a comment |
$begingroup$
Give an example of a language $L$ where $min(max L)neq max(min L)$.
I thought of the following language $L={a,bc, abc}$.
$$
min L={a,bc}, max L = {abc}
$$
Then:
$$
min(max L)=min ({abc})={abc}neq max(min L)=max({a,bc})={a,bc}
$$
This seems too simple so I'm wondering if it's correct.
The definitions of $max, min$:
$$
min L= {x|xin L land text{there doesn't exist a non-empty substring }y text{ of } x text{ such that } yin L }\
max L = {x|xin L land lnot exists y: xyin L, yneq epsilon}
$$
proof-verification formal-languages
$endgroup$
Give an example of a language $L$ where $min(max L)neq max(min L)$.
I thought of the following language $L={a,bc, abc}$.
$$
min L={a,bc}, max L = {abc}
$$
Then:
$$
min(max L)=min ({abc})={abc}neq max(min L)=max({a,bc})={a,bc}
$$
This seems too simple so I'm wondering if it's correct.
The definitions of $max, min$:
$$
min L= {x|xin L land text{there doesn't exist a non-empty substring }y text{ of } x text{ such that } yin L }\
max L = {x|xin L land lnot exists y: xyin L, yneq epsilon}
$$
proof-verification formal-languages
proof-verification formal-languages
edited Jan 28 at 12:44
Yos
asked Jan 27 at 18:57
YosYos
1,1631823
1,1631823
$begingroup$
min and max of a language are not standard operations. You should provide their definitions.
$endgroup$
– Peter Leupold
Jan 28 at 12:33
add a comment |
$begingroup$
min and max of a language are not standard operations. You should provide their definitions.
$endgroup$
– Peter Leupold
Jan 28 at 12:33
$begingroup$
min and max of a language are not standard operations. You should provide their definitions.
$endgroup$
– Peter Leupold
Jan 28 at 12:33
$begingroup$
min and max of a language are not standard operations. You should provide their definitions.
$endgroup$
– Peter Leupold
Jan 28 at 12:33
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
Your example is perfect.
Being simple is an advantage and not a problem ;)
$endgroup$
add a comment |
$begingroup$
Now with the definitions it is clear that your example is right. However, your reasoning is not correct. $bc$ can be extended to the left by $a$ to form a longer string in the language, but there is no extension to the right. The definition of $max$ only asks for extensions to the right. Therefore $bc$ is also in the $max$, and your example works like this:
$$
min(max L)=min ({bc, abc})={bc} neq {a,bc}=max({a,bc})=max(min L)
$$
$endgroup$
add a comment |
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
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
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3089977%2fgive-an-example-of-a-language-l-where-min-max-l-neq-max-min-l%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
Your example is perfect.
Being simple is an advantage and not a problem ;)
$endgroup$
add a comment |
$begingroup$
Your example is perfect.
Being simple is an advantage and not a problem ;)
$endgroup$
add a comment |
$begingroup$
Your example is perfect.
Being simple is an advantage and not a problem ;)
$endgroup$
Your example is perfect.
Being simple is an advantage and not a problem ;)
answered Jan 28 at 15:24
wecewece
2,3721923
2,3721923
add a comment |
add a comment |
$begingroup$
Now with the definitions it is clear that your example is right. However, your reasoning is not correct. $bc$ can be extended to the left by $a$ to form a longer string in the language, but there is no extension to the right. The definition of $max$ only asks for extensions to the right. Therefore $bc$ is also in the $max$, and your example works like this:
$$
min(max L)=min ({bc, abc})={bc} neq {a,bc}=max({a,bc})=max(min L)
$$
$endgroup$
add a comment |
$begingroup$
Now with the definitions it is clear that your example is right. However, your reasoning is not correct. $bc$ can be extended to the left by $a$ to form a longer string in the language, but there is no extension to the right. The definition of $max$ only asks for extensions to the right. Therefore $bc$ is also in the $max$, and your example works like this:
$$
min(max L)=min ({bc, abc})={bc} neq {a,bc}=max({a,bc})=max(min L)
$$
$endgroup$
add a comment |
$begingroup$
Now with the definitions it is clear that your example is right. However, your reasoning is not correct. $bc$ can be extended to the left by $a$ to form a longer string in the language, but there is no extension to the right. The definition of $max$ only asks for extensions to the right. Therefore $bc$ is also in the $max$, and your example works like this:
$$
min(max L)=min ({bc, abc})={bc} neq {a,bc}=max({a,bc})=max(min L)
$$
$endgroup$
Now with the definitions it is clear that your example is right. However, your reasoning is not correct. $bc$ can be extended to the left by $a$ to form a longer string in the language, but there is no extension to the right. The definition of $max$ only asks for extensions to the right. Therefore $bc$ is also in the $max$, and your example works like this:
$$
min(max L)=min ({bc, abc})={bc} neq {a,bc}=max({a,bc})=max(min L)
$$
answered Jan 29 at 11:53


Peter LeupoldPeter Leupold
63526
63526
add a comment |
add a comment |
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
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
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3089977%2fgive-an-example-of-a-language-l-where-min-max-l-neq-max-min-l%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
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
Required, but never shown
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
Required, but never shown
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
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
$begingroup$
min and max of a language are not standard operations. You should provide their definitions.
$endgroup$
– Peter Leupold
Jan 28 at 12:33