Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
How Finite automata is considered as Turing machine with a restricted tape length?
adwaitLP
asked
in
Theory of Computation
Sep 11, 2017
324
views
0
votes
0
votes
How Finite automata is considered as Turing machine with a restricted tape length?
turing-machine
finite-automata
adwaitLP
asked
in
Theory of Computation
Sep 11, 2017
by
adwaitLP
324
views
answer
comment
Follow
share this
share
0 Comments
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
1
Answer
1
vote
1
vote
Best answer
u cannot construct a finite automata that has infinite number of states and like turing machine it can move in both directions
from a particular stste u can go to the previous one or the next one
therefore its TM with finite tape
A_i_$_h
answered
Sep 12, 2017
selected
Sep 12, 2017
by
adwaitLP
by
A_i_$_h
comment
Follow
share this
0 Comments
Please
log in
or
register
to add a comment.
← Previous
Next →
← Previous in category
Next in category →
Related questions
0
votes
0
votes
0
answers
1
dragonball
asked
in
Theory of Computation
Nov 23, 2017
1,170
views
Can epsilon be used as a tape alphabet in case of Turing Machine?
dragonball
asked
in
Theory of Computation
Nov 23, 2017
by
dragonball
1.2k
views
turing-machine
0
votes
0
votes
0
answers
2
dragonball
asked
in
Theory of Computation
Oct 31, 2017
2,271
views
Turing Machine for concatenation of strings w1 and w2 where w1, w2 belongs to {a,b} using single tape
dragonball
asked
in
Theory of Computation
Oct 31, 2017
by
dragonball
2.3k
views
theory-of-computation
turing-machine
2
votes
2
votes
1
answer
3
Nishu
asked
in
Theory of Computation
Mar 13, 2016
1,184
views
simulate one tape turing machine with k-tape TM
Time taken by one tape TM to simulate n moves of k-tape TM is a) O(n) b) O(n^k) c) O(n^2) d) none of these
Nishu
asked
in
Theory of Computation
Mar 13, 2016
by
Nishu
1.2k
views
19
votes
19
votes
3
answers
4
Gourab_Classic
asked
in
Theory of Computation
Mar 14, 2016
106,516
views
How to construct an automata with even number of a's and odd number of b's?
The alphabets are a and b. Construct a DFA
Gourab_Classic
asked
in
Theory of Computation
Mar 14, 2016
by
Gourab_Classic
107k
views
minimal-state-automata
theory-of-computation
finite-automata
combinatory
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...
Twitter
WhatsApp
Facebook
Reddit
LinkedIn
Email
Link Copied!
Copy