Register

turing machine - self

557 views
1 votes
1 votes
Turing machine can be constructed by FA with 2 stacks??
User Avatar

1 Answer

0 votes
0 votes
FA+2 stack =FA+3stack=FA+4stack=FA+queue=FA+2queue=FA+3queue=FA+2CA=FA+3CA=TM
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
0 answers
1
manisha11 asked Apr 27, 2019
270 views
turing machine self doubt a+b=c
Turing machine, language A = {a+b=c | a, b, c are sequences of 1's; |c| = |a| + |b|; |a| >= 0 and |b| > 0}.
Turing machine,language A = {a+b=c | a, b, c are sequences of 1's; |c| = |a| + |b|; |a| >= 0 and |b| 0}.
User Avatar
0 votes
0 votes
0 answers
2
srestha asked Apr 13, 2019
292 views
Self doubt- Turing machine
$1)L=M$ is a turing machine $M$ accepts two strings of different length $2)L=M$ is a turing machine $M$ accepts atleast two strings of different length Which one RE? Which one REC? How to compute the different length string?
$1)L=M$ is a turing machine $M$ accepts two strings of different length $2)L=M$ is a turing machine $M$ accepts atleast two strings of different length Which one RE? Whic...
User Avatar
0 votes
0 votes
0 answers
3
Ritabrata Dey asked Mar 26, 2019
326 views
Turing Machine: Self doubt
What is the difference between Turing recognizable language and Turing decidable language? Please someone explain me clearly the concept
What is the difference between Turing recognizable language and Turing decidable language?Please someone explain me clearly the concept
User Avatar
1 votes
1 votes
3 answers
4
aditi19 asked Mar 23, 2019
612 views
Turing Machine Self Doubt
Can someone explain in details how set of all TM is countable?
Can someone explain in details how set of all TM is countable?
User Avatar
Link Copied!