Mixing
Language of this finite state automaton?
1
$begingroup$
What would be the formal definition of the language for the following Finite State Automaton?
automata finite-state-machine
asked Jan 15 at 19:21
Ansar AlAnsar Al
466
$endgroup$
|
show 2 more comments
1
$begingroup$
What would be the formal definition of the language for the following Finite State Automaton?
automata finite-state-machine
asked Jan 15 at 19:21
Ansar AlAnsar Al
466
$endgroup$
4
$begingroup$
Finite sequences of $a$'s and $b$'s that either end with a $b$ or end with $ba$.
$endgroup$
– irchans
Jan 15 at 19:29
1
$begingroup$
Is the word $b$ accepted or rejected by this automaton? What about $bab$?
$endgroup$
– Cheyne H
Jan 15 at 19:31
$begingroup$
@irchans The string $b$ wouldn't qualify as an accepted word right? Since it can also be returning to state $q_0$?
$endgroup$
– Ansar Al
Jan 15 at 19:31
2
$begingroup$
@CheyneH This is a nondeterministic finite state automaton, for which multiple (or no) transitions for a given pair of state and symbol is well-defined.
$endgroup$
– Math1000
Jan 15 at 19:42
2
$begingroup$
Just "$b$" is fine. You start in q0 and then transition to q1 and terminate.
$endgroup$
– irchans
Jan 15 at 20:57
|
show 2 more comments
1
1
1
$begingroup$
What would be the formal definition of the language for the following Finite State Automaton?
automata finite-state-machine
asked Jan 15 at 19:21
Ansar AlAnsar Al
466
$endgroup$
What would be the formal definition of the language for the following Finite State Automaton?
automata finite-state-machine
automata finite-state-machine
asked Jan 15 at 19:21
Ansar AlAnsar Al
466
asked Jan 15 at 19:21
Ansar AlAnsar Al
466
asked Jan 15 at 19:21
Ansar AlAnsar Al
466
asked Jan 15 at 19:21
Ansar AlAnsar Al
466
asked Jan 15 at 19:21
Ansar AlAnsar Al
466
466
4
$begingroup$
Finite sequences of $a$'s and $b$'s that either end with a $b$ or end with $ba$.
$endgroup$
– irchans
Jan 15 at 19:29
1
$begingroup$
Is the word $b$ accepted or rejected by this automaton? What about $bab$?
$endgroup$
– Cheyne H
Jan 15 at 19:31
$begingroup$
@irchans The string $b$ wouldn't qualify as an accepted word right? Since it can also be returning to state $q_0$?
$endgroup$
– Ansar Al
Jan 15 at 19:31
2
$begingroup$
@CheyneH This is a nondeterministic finite state automaton, for which multiple (or no) transitions for a given pair of state and symbol is well-defined.
$endgroup$
– Math1000
Jan 15 at 19:42
2
$begingroup$
Just "$b$" is fine. You start in q0 and then transition to q1 and terminate.
$endgroup$
– irchans
Jan 15 at 20:57
|
show 2 more comments
4
$begingroup$
Finite sequences of $a$'s and $b$'s that either end with a $b$ or end with $ba$.
$endgroup$
– irchans
Jan 15 at 19:29
1
$begingroup$
Is the word $b$ accepted or rejected by this automaton? What about $bab$?
$endgroup$
– Cheyne H
Jan 15 at 19:31
$begingroup$
@irchans The string $b$ wouldn't qualify as an accepted word right? Since it can also be returning to state $q_0$?
$endgroup$
– Ansar Al
Jan 15 at 19:31
2
$begingroup$
@CheyneH This is a nondeterministic finite state automaton, for which multiple (or no) transitions for a given pair of state and symbol is well-defined.
$endgroup$
– Math1000
Jan 15 at 19:42
2
$begingroup$
Just "$b$" is fine. You start in q0 and then transition to q1 and terminate.
$endgroup$
– irchans
Jan 15 at 20:57
4
4
$begingroup$
Finite sequences of $a$'s and $b$'s that either end with a $b$ or end with $ba$.
$endgroup$
– irchans
Jan 15 at 19:29
$begingroup$
Finite sequences of $a$'s and $b$'s that either end with a $b$ or end with $ba$.
$endgroup$
– irchans
Jan 15 at 19:29
1
1
$begingroup$
Is the word $b$ accepted or rejected by this automaton? What about $bab$?
$endgroup$
– Cheyne H
Jan 15 at 19:31
$begingroup$
Is the word $b$ accepted or rejected by this automaton? What about $bab$?
$endgroup$
– Cheyne H
Jan 15 at 19:31
$begingroup$
@irchans The string $b$ wouldn't qualify as an accepted word right? Since it can also be returning to state $q_0$?
$endgroup$
– Ansar Al
Jan 15 at 19:31
$begingroup$
@irchans The string $b$ wouldn't qualify as an accepted word right? Since it can also be returning to state $q_0$?
$endgroup$
– Ansar Al
Jan 15 at 19:31
2
2
$begingroup$
@CheyneH This is a nondeterministic finite state automaton, for which multiple (or no) transitions for a given pair of state and symbol is well-defined.
$endgroup$
– Math1000
Jan 15 at 19:42
$begingroup$
@CheyneH This is a nondeterministic finite state automaton, for which multiple (or no) transitions for a given pair of state and symbol is well-defined.
$endgroup$
– Math1000
Jan 15 at 19:42
2
2
$begingroup$
Just "$b$" is fine. You start in q0 and then transition to q1 and terminate.
$endgroup$
– irchans
Jan 15 at 20:57
$begingroup$
Just "$b$" is fine. You start in q0 and then transition to q1 and terminate.
$endgroup$
– irchans
Jan 15 at 20:57
|
show 2 more comments
1 Answer
1
active
oldest
votes
0
$begingroup$
Your language consists of all words over ${a,b}$ ending in $b$ or in $ba$. You can write it as a regular expression:
$$ (a+b)^*b(epsilon + a). $$
answered Jan 16 at 21:17
Yuval FilmusYuval Filmus
48.6k471145
$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
});
}
});
draft saved
draft discarded
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%2f3074829%2flanguage-of-this-finite-state-automaton%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
0
$begingroup$
Your language consists of all words over ${a,b}$ ending in $b$ or in $ba$. You can write it as a regular expression:
$$ (a+b)^*b(epsilon + a). $$
answered Jan 16 at 21:17
Yuval FilmusYuval Filmus
48.6k471145
$endgroup$
add a comment |
0
$begingroup$
Your language consists of all words over ${a,b}$ ending in $b$ or in $ba$. You can write it as a regular expression:
$$ (a+b)^*b(epsilon + a). $$
answered Jan 16 at 21:17
Yuval FilmusYuval Filmus
48.6k471145
$endgroup$
add a comment |
0
0
0
$begingroup$
Your language consists of all words over ${a,b}$ ending in $b$ or in $ba$. You can write it as a regular expression:
$$ (a+b)^*b(epsilon + a). $$
answered Jan 16 at 21:17
Yuval FilmusYuval Filmus
48.6k471145
$endgroup$
Your language consists of all words over ${a,b}$ ending in $b$ or in $ba$. You can write it as a regular expression:
$$ (a+b)^*b(epsilon + a). $$
answered Jan 16 at 21:17
Yuval FilmusYuval Filmus
48.6k471145
answered Jan 16 at 21:17
Yuval FilmusYuval Filmus
48.6k471145
answered Jan 16 at 21:17
Yuval FilmusYuval Filmus
48.6k471145
answered Jan 16 at 21:17
Yuval FilmusYuval Filmus
48.6k471145
48.6k471145
add a comment |
add a comment |
draft saved
draft discarded
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.
draft saved
draft discarded
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%2f3074829%2flanguage-of-this-finite-state-automaton%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
4
$begingroup$
Finite sequences of $a$'s and $b$'s that either end with a $b$ or end with $ba$.
$endgroup$
– irchans
Jan 15 at 19:29
1
$begingroup$
Is the word $b$ accepted or rejected by this automaton? What about $bab$?
$endgroup$
– Cheyne H
Jan 15 at 19:31
$begingroup$
@irchans The string $b$ wouldn't qualify as an accepted word right? Since it can also be returning to state $q_0$?
$endgroup$
– Ansar Al
Jan 15 at 19:31
2
$begingroup$
@CheyneH This is a nondeterministic finite state automaton, for which multiple (or no) transitions for a given pair of state and symbol is well-defined.
$endgroup$
– Math1000
Jan 15 at 19:42
2
$begingroup$
Just "$b$" is fine. You start in q0 and then transition to q1 and terminate.
$endgroup$
– irchans
Jan 15 at 20:57