Mixing
$A,C$ are recursive and $Acdot B = C$, Is $B$ is recursive?
Past year paper question.
Prove or disprove: Suppose $A,C$ are recursive and $Acdot B = C$ (The dot denotes concatenation). Then $B$ is recursive.
I think it is false.
Let $B$ be any non-recursive language containing the empty string $epsilon$.
Let $A=C=Sigma^*$.
Then $A cdot B = C$.
Question is how can I construct $B$?
formal-languages
asked Nov 21 '18 at 8:29
eatfood
1827
add a comment |
Past year paper question.
Prove or disprove: Suppose $A,C$ are recursive and $Acdot B = C$ (The dot denotes concatenation). Then $B$ is recursive.
I think it is false.
Let $B$ be any non-recursive language containing the empty string $epsilon$.
Let $A=C=Sigma^*$.
Then $A cdot B = C$.
Question is how can I construct $B$?
formal-languages
asked Nov 21 '18 at 8:29
eatfood
1827
Why do you mean by constructing a non-recursive language?
– J.-E. Pin
Nov 21 '18 at 8:35
I mean is there a concrete example of a non-recursive language, that contains the empty string.
– eatfood
Nov 21 '18 at 8:57
add a comment |
Past year paper question.
Prove or disprove: Suppose $A,C$ are recursive and $Acdot B = C$ (The dot denotes concatenation). Then $B$ is recursive.
I think it is false.
Let $B$ be any non-recursive language containing the empty string $epsilon$.
Let $A=C=Sigma^*$.
Then $A cdot B = C$.
Question is how can I construct $B$?
formal-languages
asked Nov 21 '18 at 8:29
eatfood
1827
Past year paper question.
Prove or disprove: Suppose $A,C$ are recursive and $Acdot B = C$ (The dot denotes concatenation). Then $B$ is recursive.
I think it is false.
Let $B$ be any non-recursive language containing the empty string $epsilon$.
Let $A=C=Sigma^*$.
Then $A cdot B = C$.
Question is how can I construct $B$?
formal-languages
formal-languages
asked Nov 21 '18 at 8:29
eatfood
1827
asked Nov 21 '18 at 8:29
eatfood
1827
asked Nov 21 '18 at 8:29
eatfood
1827
asked Nov 21 '18 at 8:29
eatfood
1827
asked Nov 21 '18 at 8:29
eatfood
1827
1827
Why do you mean by constructing a non-recursive language?
– J.-E. Pin
Nov 21 '18 at 8:35
I mean is there a concrete example of a non-recursive language, that contains the empty string.
– eatfood
Nov 21 '18 at 8:57
add a comment |
Why do you mean by constructing a non-recursive language?
– J.-E. Pin
Nov 21 '18 at 8:35
I mean is there a concrete example of a non-recursive language, that contains the empty string.
– eatfood
Nov 21 '18 at 8:57
Why do you mean by constructing a non-recursive language?
– J.-E. Pin
Nov 21 '18 at 8:35
Why do you mean by constructing a non-recursive language?
– J.-E. Pin
Nov 21 '18 at 8:35
I mean is there a concrete example of a non-recursive language, that contains the empty string.
– eatfood
Nov 21 '18 at 8:57
I mean is there a concrete example of a non-recursive language, that contains the empty string.
– eatfood
Nov 21 '18 at 8:57
add a comment |
1 Answer
1
active
oldest
votes
Probably you can just suppose that there exists a non-recursive language that contains the empty string, and nobody will demand a proof of this.
Adding or removing a finite number of strings will not change the recursiveness or non-recursiveness of a language. In particular, adding the empty string will not change the complexity (take a TM for the language, add by a non-deterministic choice the possibility to accept the empty string instead of starting the original computation; even if the original TM rejects the empty string, the new one will accept it). So if you are allowed to suppose without proof that there exist non-recursive languages, then you can just take any of them and add the empty string and it will still be non-recursive.
answered Nov 21 '18 at 9:49
Peter Leupold
56826
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%2f3007432%2fa-c-are-recursive-and-a-cdot-b-c-is-b-is-recursive%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
Probably you can just suppose that there exists a non-recursive language that contains the empty string, and nobody will demand a proof of this.
Adding or removing a finite number of strings will not change the recursiveness or non-recursiveness of a language. In particular, adding the empty string will not change the complexity (take a TM for the language, add by a non-deterministic choice the possibility to accept the empty string instead of starting the original computation; even if the original TM rejects the empty string, the new one will accept it). So if you are allowed to suppose without proof that there exist non-recursive languages, then you can just take any of them and add the empty string and it will still be non-recursive.
answered Nov 21 '18 at 9:49
Peter Leupold
56826
add a comment |
Probably you can just suppose that there exists a non-recursive language that contains the empty string, and nobody will demand a proof of this.
Adding or removing a finite number of strings will not change the recursiveness or non-recursiveness of a language. In particular, adding the empty string will not change the complexity (take a TM for the language, add by a non-deterministic choice the possibility to accept the empty string instead of starting the original computation; even if the original TM rejects the empty string, the new one will accept it). So if you are allowed to suppose without proof that there exist non-recursive languages, then you can just take any of them and add the empty string and it will still be non-recursive.
answered Nov 21 '18 at 9:49
Peter Leupold
56826
add a comment |
Probably you can just suppose that there exists a non-recursive language that contains the empty string, and nobody will demand a proof of this.
Adding or removing a finite number of strings will not change the recursiveness or non-recursiveness of a language. In particular, adding the empty string will not change the complexity (take a TM for the language, add by a non-deterministic choice the possibility to accept the empty string instead of starting the original computation; even if the original TM rejects the empty string, the new one will accept it). So if you are allowed to suppose without proof that there exist non-recursive languages, then you can just take any of them and add the empty string and it will still be non-recursive.
answered Nov 21 '18 at 9:49
Peter Leupold
56826
Probably you can just suppose that there exists a non-recursive language that contains the empty string, and nobody will demand a proof of this.
Adding or removing a finite number of strings will not change the recursiveness or non-recursiveness of a language. In particular, adding the empty string will not change the complexity (take a TM for the language, add by a non-deterministic choice the possibility to accept the empty string instead of starting the original computation; even if the original TM rejects the empty string, the new one will accept it). So if you are allowed to suppose without proof that there exist non-recursive languages, then you can just take any of them and add the empty string and it will still be non-recursive.
answered Nov 21 '18 at 9:49
Peter Leupold
56826
answered Nov 21 '18 at 9:49
Peter Leupold
56826
answered Nov 21 '18 at 9:49
Peter Leupold
56826
answered Nov 21 '18 at 9:49
Peter Leupold
56826
56826
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.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- 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.
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%2f3007432%2fa-c-are-recursive-and-a-cdot-b-c-is-b-is-recursive%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
Why do you mean by constructing a non-recursive language?
– J.-E. Pin
Nov 21 '18 at 8:35
I mean is there a concrete example of a non-recursive language, that contains the empty string.
– eatfood
Nov 21 '18 at 8:57