Automata|f(L) take the length of a regular language's prefix to the length of the restAutomata | Prove that if $L$ is regular than $half(L)$ is regular tooConnecting finite automata and regular languages in teaching/applicationsA regular expression for the words that don't contain the sequence $ab$ over $a,b,c$Is there an (explicit?) bijection from the set of all automatons to the set of all regular expressions preserving the recognised languageHelp with proving a language is regular (Sipser problem 1.49a)Construct an automata for this languageProve that $w mid text w has even length and the first half of w has more 0s than the second half of w $ is not regular?proving that $L_textalmost$ is a regular languageRegular Expression VS Finite AutomataContext Free Grammar - Middle of an Even Binary StringAutomata|The mid 1/3 of regular language is still regular
Why Is Death Allowed In the Matrix?
Why is "Reports" in sentence down without "The"
When blogging recipes, how can I support both readers who want the narrative/journey and ones who want the printer-friendly recipe?
Copycat chess is back
Why is an old chain unsafe?
LED on same Pin as Toggle Switch, not illuminating
New order #4: World
Patience, young "Padovan"
What is the meaning of "of trouble" in the following sentence?
Why is the design of haulage companies so “special”?
What defenses are there against being summoned by the Gate spell?
The magic money tree problem
Prevent a directory in /tmp from being deleted
declaring a variable twice in IIFE
A newer friend of my brother's gave him a load of baseball cards that are supposedly extremely valuable. Is this a scam?
Japan - Plan around max visa duration
Simulate Bitwise Cyclic Tag
Is Social Media Science Fiction?
N.B. ligature in Latex
How does one intimidate enemies without having the capacity for violence?
A function which translates a sentence to title-case
Can Medicine checks be used, with decent rolls, to completely mitigate the risk of death from ongoing damage?
Can I make popcorn with any corn?
What would happen to a modern skyscraper if it rains micro blackholes?
Automata|f(L) take the length of a regular language's prefix to the length of the rest
Automata | Prove that if $L$ is regular than $half(L)$ is regular tooConnecting finite automata and regular languages in teaching/applicationsA regular expression for the words that don't contain the sequence $ab$ over $a,b,c$Is there an (explicit?) bijection from the set of all automatons to the set of all regular expressions preserving the recognised languageHelp with proving a language is regular (Sipser problem 1.49a)Construct an automata for this languageProve that $w mid text w has even length and the first half of w has more 0s than the second half of w $ is not regular?proving that $L_textalmost$ is a regular languageRegular Expression VS Finite AutomataContext Free Grammar - Middle of an Even Binary StringAutomata|The mid 1/3 of regular language is still regular
$begingroup$
If $f$ is a function of integers, define $f(L)$ to be
$$
w mid textfor some $x$, with $.
$$
Show that if $L$ is a regular language, then so if $f(L)$, if $f$ is one of the following functions:
$f(n)=n^2$ (i.e., the amount we take has length equal to the square root of what we do not take)- $f(n)=2^n$
This is a question from John Hopcroft's Introduction to Automata Theory, that is, Exercise 4.2.9.
And I find it hard to construct a automata like what we do in this question.
automata
$endgroup$
add a comment |
$begingroup$
If $f$ is a function of integers, define $f(L)$ to be
$$
w mid textfor some $x$, with $.
$$
Show that if $L$ is a regular language, then so if $f(L)$, if $f$ is one of the following functions:
$f(n)=n^2$ (i.e., the amount we take has length equal to the square root of what we do not take)- $f(n)=2^n$
This is a question from John Hopcroft's Introduction to Automata Theory, that is, Exercise 4.2.9.
And I find it hard to construct a automata like what we do in this question.
automata
$endgroup$
add a comment |
$begingroup$
If $f$ is a function of integers, define $f(L)$ to be
$$
w mid textfor some $x$, with $.
$$
Show that if $L$ is a regular language, then so if $f(L)$, if $f$ is one of the following functions:
$f(n)=n^2$ (i.e., the amount we take has length equal to the square root of what we do not take)- $f(n)=2^n$
This is a question from John Hopcroft's Introduction to Automata Theory, that is, Exercise 4.2.9.
And I find it hard to construct a automata like what we do in this question.
automata
$endgroup$
If $f$ is a function of integers, define $f(L)$ to be
$$
w mid textfor some $x$, with $.
$$
Show that if $L$ is a regular language, then so if $f(L)$, if $f$ is one of the following functions:
$f(n)=n^2$ (i.e., the amount we take has length equal to the square root of what we do not take)- $f(n)=2^n$
This is a question from John Hopcroft's Introduction to Automata Theory, that is, Exercise 4.2.9.
And I find it hard to construct a automata like what we do in this question.
automata
automata
edited Mar 24 at 3:00
J.-E. Pin
18.6k21754
18.6k21754
asked Mar 22 at 9:52
My_LuluMy_Lulu
125
125
add a comment |
add a comment |
0
active
oldest
votes
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%2f3157959%2fautomatafl-take-the-length-of-a-regular-languages-prefix-to-the-length-of-th%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
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%2f3157959%2fautomatafl-take-the-length-of-a-regular-languages-prefix-to-the-length-of-th%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