Can I use regular expression as an input to a turing machine?
up vote
-1
down vote
favorite
So lets assume L is a set that takes M as an input. M is turing machine s.t M does not accept any string starting with a '1'. Our alphabet is 0,1. Ok so my question is can I use M("^[^1]") to represent any string that is our set L? Thank you.
complexity-theory turing-machines computation
asked Nov 10 at 12:10
Dylan Finerty
13
New contributor
Dylan Finerty is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
add a comment |
up vote
-1
down vote
favorite
So lets assume L is a set that takes M as an input. M is turing machine s.t M does not accept any string starting with a '1'. Our alphabet is 0,1. Ok so my question is can I use M("^[^1]") to represent any string that is our set L? Thank you.
complexity-theory turing-machines computation
asked Nov 10 at 12:10
Dylan Finerty
13
New contributor
Dylan Finerty is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
add a comment |
up vote
-1
down vote
favorite
up vote
-1
down vote
favorite
So lets assume L is a set that takes M as an input. M is turing machine s.t M does not accept any string starting with a '1'. Our alphabet is 0,1. Ok so my question is can I use M("^[^1]") to represent any string that is our set L? Thank you.
complexity-theory turing-machines computation
asked Nov 10 at 12:10
Dylan Finerty
13
New contributor
Dylan Finerty is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
So lets assume L is a set that takes M as an input. M is turing machine s.t M does not accept any string starting with a '1'. Our alphabet is 0,1. Ok so my question is can I use M("^[^1]") to represent any string that is our set L? Thank you.
complexity-theory turing-machines computation
complexity-theory turing-machines computation
asked Nov 10 at 12:10
Dylan Finerty
13
New contributor
Dylan Finerty is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
asked Nov 10 at 12:10
Dylan Finerty
13
New contributor
Dylan Finerty is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
edited Nov 10 at 16:27
asked Nov 10 at 12:10
Dylan Finerty
13
New contributor
Dylan Finerty is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
asked Nov 10 at 12:10
Dylan Finerty
13
asked Nov 10 at 12:10
Dylan Finerty
13
13
New contributor
Dylan Finerty is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
New contributor
Dylan Finerty is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
Dylan Finerty is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
add a comment |
add a comment |
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
Dylan Finerty is a new contributor. Be nice, and check out our Code of Conduct.
Dylan Finerty is a new contributor. Be nice, and check out our Code of Conduct.
Dylan Finerty is a new contributor. Be nice, and check out our Code of Conduct.
Dylan Finerty is a new contributor. Be nice, and check out our Code of Conduct.
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
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53238806%2fcan-i-use-regular-expression-as-an-input-to-a-turing-machine%23new-answer', 'question_page');
);
Post as a guest
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
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
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
