Ask
Login
TAGGED IN

Theory Of Computation

Follow this tag to get notifications whenever a new post is added

ALL TAGS
6
votes
7
answers
3.2k
views
7
answers
Theory Of Computation : Question Paper Dec 2014 - Computer Engineering (Semester 6) | Gujarat Technological University (GTU)
theory of computation updated 3.1 years ago by binitamayekar ★ 6.6k
0
votes
1
answer
615
views
1
answer
Explain Mealey machine and Moore machine
theory of computation updated 3.6 years ago by teamques10 ★ 68k
0
votes
1
answer
614
views
1
answer
Compare Moore and Mealy machine models.
theory of computation updated 3.6 years ago by teamques10 ★ 68k
0
votes
1
answer
3.8k
views
1
answer
Explain Intractable problems and their classification in detail
theory of computation updated 4.0 years ago by teamques10 ★ 68k
0
votes
1
answer
6.9k
views
1
answer
Short Note on Rice theorem.
theory of computation updated 4.0 years ago by teamques10 ★ 68k
2
votes
1
answer
13k
views
1
answer
State and prove Rice's theorem.
theory of computation updated 4.0 years ago by teamques10 ★ 68k
0
votes
1
answer
3.5k
views
1
answer
Short note on Rice's Theorem ( Need Review )
theory of computation updated 4.0 years ago by teamques10 ★ 68k
1
vote
1
answer
3.0k
views
1
answer
State and prove the Halting problem.
theory of computation updated 4.0 years ago by teamques10 ★ 68k
2
votes
1
answer
10k
views
1
answer
Compare recursive and recursively enumerable languages
theory of computation updated 4.0 years ago by teamques10 ★ 68k
0
votes
1
answer
1.4k
views
1
answer
Compare recursive and recursively enumerable languages.
theory of computation updated 4.0 years ago by teamques10 ★ 68k
0
votes
1
answer
4.9k
views
1
answer
Short Note On : Recursive and Recursively Enumerable Languages.
theory of computation updated 4.0 years ago by teamques10 ★ 68k
12
votes
1
answer
78k
views
1
answer
Write short note on Universal Turing Machine.
theory of computation updated 4.0 years ago by teamques10 ★ 68k
2
votes
1
answer
4.5k
views
1
answer
Variarst of Turning Machine
theory of computation updated 4.0 years ago by teamques10 ★ 68k
0
votes
1
answer
4.1k
views
1
answer
State and prove the halting problem
theory of computation updated 4.0 years ago by teamques10 ★ 68k
1
vote
1
answer
21k
views
1
answer
Construct Turing machine that accepts the string over E={0,1} and converts every occurrence of 111 to 101.
theory of computation updated 4.0 years ago by teamques10 ★ 68k
0
votes
1
answer
6.0k
views
1
answer
Design a Turing Machine which accepts all strings of the form anbn, n>=1
theory of computation updated 4.0 years ago by teamques10 ★ 68k
0
votes
1
answer
9.5k
views
1
answer
Design a Turing Machine to find the value of log 2n, where n is a unary number.
theory of computation updated 4.0 years ago by teamques10 ★ 68k
0
votes
1
answer
8.4k
views
1
answer
Design a Turing Machine which accepts all strings of the form 0n1n, n>=1
theory of computation updated 4.0 years ago by teamques10 ★ 68k
1
vote
1
answer
5.1k
views
1
answer
Explain post correspondence problem.
theory of computation updated 4.0 years ago by teamques10 ★ 68k
0
votes
1
answer
1.3k
views
1
answer
Design DPDA to accept language
theory of computation updated 4.0 years ago by teamques10 ★ 68k
0
votes
1
answer
2.7k
views
1
answer
Design PDA to accept language L={a"b"n-1}.
theory of computation updated 4.0 years ago by teamques10 ★ 68k
0
votes
1
answer
2.4k
views
1
answer
Construct PDA accepting the language. L = {anbn|n>0}.
theory of computation updated 4.0 years ago by teamques10 ★ 68k
0
votes
1
answer
6.2k
views
1
answer
Design a PDA that accepts all the strings containing equal number of a and b
theory of computation updated 4.0 years ago by teamques10 ★ 68k
2
votes
1
answer
26k
views
1
answer
Design a PDA to check for well-formed parentheses
theory of computation updated 4.0 years ago by teamques10 ★ 68k
0
votes
1
answer
4.3k
views
1
answer
Construct a PDA accepting the following language :
theory of computation updated 4.0 years ago by teamques10 ★ 68k
<prev • 104 results • page 2 of 5 • next >