Ask
Login
0
votes
1
answer
1.6k
views
1
answer
Compare recursive and recursively enumerable languages.
theory of computation updated 5.4 years ago by teamques10 ★ 70k
0
votes
1
answer
5.5k
views
1
answer
Short Note On : Recursive and Recursively Enumerable Languages.
theory of computation updated 5.4 years ago by teamques10 ★ 70k
12
votes
1
answer
79k
views
1
answer
Write short note on Universal Turing Machine.
theory of computation updated 5.4 years ago by teamques10 ★ 70k
2
votes
1
answer
5.0k
views
1
answer
Variarst of Turning Machine
theory of computation updated 5.4 years ago by teamques10 ★ 70k
0
votes
1
answer
4.4k
views
1
answer
State and prove the halting problem
theory of computation updated 5.4 years ago by teamques10 ★ 70k
1
vote
1
answer
23k
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 5.4 years ago by teamques10 ★ 70k
0
votes
1
answer
6.4k
views
1
answer
Design a Turing Machine which accepts all strings of the form anbn, n>=1
theory of computation updated 5.4 years ago by teamques10 ★ 70k
0
votes
1
answer
10k
views
1
answer
Design a Turing Machine to find the value of log 2n, where n is a unary number.
theory of computation updated 5.4 years ago by teamques10 ★ 70k
0
votes
1
answer
8.9k
views
1
answer
Design a Turing Machine which accepts all strings of the form 0n1n, n>=1
theory of computation updated 5.4 years ago by teamques10 ★ 70k
1
vote
1
answer
5.5k
views
1
answer
Explain post correspondence problem.
theory of computation updated 5.4 years ago by teamques10 ★ 70k
0
votes
1
answer
1.5k
views
1
answer
Design DPDA to accept language
theory of computation updated 5.4 years ago by teamques10 ★ 70k
0
votes
1
answer
2.9k
views
1
answer
Design PDA to accept language L={a"b"n-1}.
theory of computation updated 5.4 years ago by teamques10 ★ 70k
0
votes
1
answer
2.6k
views
1
answer
Construct PDA accepting the language. L = {anbn|n>0}.
theory of computation updated 5.4 years ago by teamques10 ★ 70k
0
votes
1
answer
6.7k
views
1
answer
Design a PDA that accepts all the strings containing equal number of a and b
theory of computation updated 5.4 years ago by teamques10 ★ 70k
2
votes
1
answer
28k
views
1
answer
Design a PDA to check for well-formed parentheses
theory of computation updated 5.4 years ago by teamques10 ★ 70k
0
votes
1
answer
4.6k
views
1
answer
Construct a PDA accepting the following language :
theory of computation updated 5.4 years ago by teamques10 ★ 70k
0
votes
1
answer
4.4k
views
1
answer
Construct a PDA equivalent to following grammar:
theory of computation updated 5.4 years ago by teamques10 ★ 70k
0
votes
1
answer
2.6k
views
1
answer
Construct a PDA accepting the language of Palindromes.
theory of computation updated 5.4 years ago by teamques10 ★ 70k
0
votes
1
answer
5.7k
views
1
answer
Construct PDA accepting the language L={anbn |n>0}.
theory of computation updated 5.4 years ago by teamques10 ★ 70k
0
votes
1
answer
2.1k
views
1
answer
Design PDA to check even parentheses
theory of computation updated 5.4 years ago by teamques10 ★ 70k
0
votes
1
answer
997
views
1
answer
Design a PDA correponding to the to the grammar
theory of computation updated 5.4 years ago by teamques10 ★ 70k
0
votes
1
answer
3.9k
views
1
answer
Give formal definition of a Push Down Automata.
theory of computation updated 5.4 years ago by teamques10 ★ 70k
0
votes
1
answer
5.9k
views
1
answer
Explain with an example Chomsky Normal Form
theory of computation updated 5.4 years ago by teamques10 ★ 70k
0
votes
1
answer
16k
views
1
answer
Write Short Notes on Kleene Closure
theory of computation updated 5.4 years ago by teamques10 ★ 70k
1
vote
1
answer
5.0k
views
1
answer
Give applications of regular expressions
theory of computation updated 5.4 years ago by teamques10 ★ 70k
<prev • 28,287 results • page 534 of 1132 • next >