Binary prime numbers: grammar
I want to write a grammar which produces binary prime numbers. But I can't find any patterns this grammar can be made of. Like this:
1. In binary all prime numbers except 2 begin and end with 1
2. Concatenation of 2 prime numbers is a prime number (not 100% sure about this...)
If I had a whole set of such rules, it wouldn't be hard to write a grammar. Any information will be valuable for me!
Thank you in advance!
automata binary formal-grammar
asked Nov 10 '18 at 21:29
Anton Ostrouhhov
61
add a comment |
I want to write a grammar which produces binary prime numbers. But I can't find any patterns this grammar can be made of. Like this:
1. In binary all prime numbers except 2 begin and end with 1
2. Concatenation of 2 prime numbers is a prime number (not 100% sure about this...)
If I had a whole set of such rules, it wouldn't be hard to write a grammar. Any information will be valuable for me!
Thank you in advance!
automata binary formal-grammar
asked Nov 10 '18 at 21:29
Anton Ostrouhhov
61
It would seem there's no context-free grammar whose language is the set of primes (or even an infinite subset of primes), though I don't really understand the proof. This is only a partial answer since maybe the primes could be generated by a more exotic grammar, though I doubt it.
– Jack M
Nov 10 '18 at 22:43
1
@JackM Thank you for reply! I am talking about Type-0 and Type-1 grammars (Chomsky hierarchy) which describe Recursively enumerable and Context-sensitive languages.
– Anton Ostrouhhov
Nov 11 '18 at 6:55
add a comment |
I want to write a grammar which produces binary prime numbers. But I can't find any patterns this grammar can be made of. Like this:
1. In binary all prime numbers except 2 begin and end with 1
2. Concatenation of 2 prime numbers is a prime number (not 100% sure about this...)
If I had a whole set of such rules, it wouldn't be hard to write a grammar. Any information will be valuable for me!
Thank you in advance!
automata binary formal-grammar
asked Nov 10 '18 at 21:29
Anton Ostrouhhov
61
I want to write a grammar which produces binary prime numbers. But I can't find any patterns this grammar can be made of. Like this:
1. In binary all prime numbers except 2 begin and end with 1
2. Concatenation of 2 prime numbers is a prime number (not 100% sure about this...)
If I had a whole set of such rules, it wouldn't be hard to write a grammar. Any information will be valuable for me!
Thank you in advance!
automata binary formal-grammar
automata binary formal-grammar
asked Nov 10 '18 at 21:29
Anton Ostrouhhov
61
asked Nov 10 '18 at 21:29
Anton Ostrouhhov
61
asked Nov 10 '18 at 21:29
Anton Ostrouhhov
61
asked Nov 10 '18 at 21:29
Anton Ostrouhhov
61
asked Nov 10 '18 at 21:29
Anton Ostrouhhov
61
61
It would seem there's no context-free grammar whose language is the set of primes (or even an infinite subset of primes), though I don't really understand the proof. This is only a partial answer since maybe the primes could be generated by a more exotic grammar, though I doubt it.
– Jack M
Nov 10 '18 at 22:43
1
@JackM Thank you for reply! I am talking about Type-0 and Type-1 grammars (Chomsky hierarchy) which describe Recursively enumerable and Context-sensitive languages.
– Anton Ostrouhhov
Nov 11 '18 at 6:55
add a comment |
It would seem there's no context-free grammar whose language is the set of primes (or even an infinite subset of primes), though I don't really understand the proof. This is only a partial answer since maybe the primes could be generated by a more exotic grammar, though I doubt it.
– Jack M
Nov 10 '18 at 22:43
1
@JackM Thank you for reply! I am talking about Type-0 and Type-1 grammars (Chomsky hierarchy) which describe Recursively enumerable and Context-sensitive languages.
– Anton Ostrouhhov
Nov 11 '18 at 6:55
It would seem there's no context-free grammar whose language is the set of primes (or even an infinite subset of primes), though I don't really understand the proof. This is only a partial answer since maybe the primes could be generated by a more exotic grammar, though I doubt it.
– Jack M
Nov 10 '18 at 22:43
It would seem there's no context-free grammar whose language is the set of primes (or even an infinite subset of primes), though I don't really understand the proof. This is only a partial answer since maybe the primes could be generated by a more exotic grammar, though I doubt it.
– Jack M
Nov 10 '18 at 22:43
1
1
@JackM Thank you for reply! I am talking about Type-0 and Type-1 grammars (Chomsky hierarchy) which describe Recursively enumerable and Context-sensitive languages.
– Anton Ostrouhhov
Nov 11 '18 at 6:55
@JackM Thank you for reply! I am talking about Type-0 and Type-1 grammars (Chomsky hierarchy) which describe Recursively enumerable and Context-sensitive languages.
– Anton Ostrouhhov
Nov 11 '18 at 6:55
add a comment |
1 Answer
1
active
oldest
votes
I have not found such a patterns/rules so far... But I found another way to solve this problem.
I wrote Turing Machine which accepts binary primary numbers (GitHub Gist). After that my friend wrote interpreter from TM to Grammar (examples can be found on GitHub). We got about 77000 productions in resulting Grammar. I believe this number can be reduced a lot, but this is another story anyway :)
answered Nov 26 '18 at 7:38
Anton Ostrouhhov
61
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%2f2993154%2fbinary-prime-numbers-grammar%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
I have not found such a patterns/rules so far... But I found another way to solve this problem.
I wrote Turing Machine which accepts binary primary numbers (GitHub Gist). After that my friend wrote interpreter from TM to Grammar (examples can be found on GitHub). We got about 77000 productions in resulting Grammar. I believe this number can be reduced a lot, but this is another story anyway :)
answered Nov 26 '18 at 7:38
Anton Ostrouhhov
61
add a comment |
I have not found such a patterns/rules so far... But I found another way to solve this problem.
I wrote Turing Machine which accepts binary primary numbers (GitHub Gist). After that my friend wrote interpreter from TM to Grammar (examples can be found on GitHub). We got about 77000 productions in resulting Grammar. I believe this number can be reduced a lot, but this is another story anyway :)
answered Nov 26 '18 at 7:38
Anton Ostrouhhov
61
add a comment |
I have not found such a patterns/rules so far... But I found another way to solve this problem.
I wrote Turing Machine which accepts binary primary numbers (GitHub Gist). After that my friend wrote interpreter from TM to Grammar (examples can be found on GitHub). We got about 77000 productions in resulting Grammar. I believe this number can be reduced a lot, but this is another story anyway :)
answered Nov 26 '18 at 7:38
Anton Ostrouhhov
61
I have not found such a patterns/rules so far... But I found another way to solve this problem.
I wrote Turing Machine which accepts binary primary numbers (GitHub Gist). After that my friend wrote interpreter from TM to Grammar (examples can be found on GitHub). We got about 77000 productions in resulting Grammar. I believe this number can be reduced a lot, but this is another story anyway :)
answered Nov 26 '18 at 7:38
Anton Ostrouhhov
61
answered Nov 26 '18 at 7:38
Anton Ostrouhhov
61
answered Nov 26 '18 at 7:38
Anton Ostrouhhov
61
answered Nov 26 '18 at 7:38
Anton Ostrouhhov
61
61
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%2f2993154%2fbinary-prime-numbers-grammar%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
It would seem there's no context-free grammar whose language is the set of primes (or even an infinite subset of primes), though I don't really understand the proof. This is only a partial answer since maybe the primes could be generated by a more exotic grammar, though I doubt it.
– Jack M
Nov 10 '18 at 22:43
1
@JackM Thank you for reply! I am talking about Type-0 and Type-1 grammars (Chomsky hierarchy) which describe Recursively enumerable and Context-sensitive languages.
– Anton Ostrouhhov
Nov 11 '18 at 6:55