Ask
Login
TAGGED IN

Theory Of Computation

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

ALL TAGS
0
votes
1
answer
9.4k
views
1
answer
Eliminate Left recursion in the following grammar (Remove Direct and Indirect recursion) S->AA l B A -> AC | SD | E
theory of computation updated 3.8 years ago by pedsangini276 • 4.8k
0
votes
1
answer
2.6k
views
1
answer
a. Design a DFA over an alphabet {a, b} to recognize a language in which every a is followed by b
theory of computation updated 3.8 years ago by pedsangini276 • 4.8k
0
votes
1
answer
2.4k
views
1
answer
Consider the following grammar G = (V, T, P, S), V = {S, X, Y}, T {a, b} and productions P are Convert this grammer in Chomsky Normal Form (CNF).
theory of computation updated 3.8 years ago by pedsangini276 • 4.8k
0
votes
1
answer
12k
views
1
answer
Distinguish between DFA and NFA
theory of computation updated 3.8 years ago by pedsangini276 • 4.8k
0
votes
1
answer
3.1k
views
1
answer
Define a NDFA with and example
theory of computation updated 3.8 years ago by pedsangini276 • 4.8k
0
votes
1
answer
8.5k
views
1
answer
Write regular expression for the following languages.
theory of computation updated 3.8 years ago by pedsangini276 • 4.8k
1
vote
1
answer
34k
views
1
answer
Differentiate between NFA and DFA.
theory of computation updated 3.8 years ago by pedsangini276 • 4.8k
1
vote
1
answer
8.9k
views
1
answer
Design DPDA to accept languages L={x {a,b} | Na(x) >Nb(x) }, Na(x) >Nb(x) means number of as are greater than number of bs in string x.
theory of computation updated 3.8 years ago by teamques10 ★ 70k
0
votes
1
answer
2.5k
views
1
answer
Give formal definition of a Push Down Automata
theory of computation updated 3.8 years ago by teamques10 ★ 70k
3
votes
1
answer
29k
views
1
answer
State and explain the power and limitations of a Turing machine.
theory of computation updated 3.8 years ago by teamques10 ★ 70k
0
votes
1
answer
41k
views
1
answer
Design a mealy machine to determine the residue mod 3 of a binary number.
theory of computation updated 3.8 years ago by teamques10 ★ 70k
0
votes
1
answer
2.7k
views
1
answer
Show that language L={0^i | i is prime number} is not regular
theory of computation updated 3.8 years ago by teamques10 ★ 70k
0
votes
1
answer
4.8k
views
1
answer
Design the DFA to accept all the binary strings over {0,1} that are beginning with 1 and having its decimal value multiple of 5
theory of computation updated 3.8 years ago by teamques10 ★ 70k
3
votes
1
answer
25k
views
1
answer
Design mealy machine to find out 2s complement of a binary number
theory of computation updated 3.8 years ago by teamques10 ★ 70k
0
votes
1
answer
3.2k
views
1
answer
1. Consider the following grammar G=(V,T,P,S), V={S,X}, T={a,b} and productions P are S-> aSb | aX X->Xa|Sa|a Convert this grammer in Greibach Normal Form (GNF).
theory of computation updated 3.8 years ago by teamques10 ★ 70k
1
vote
1
answer
11k
views
1
answer
Design a tuning machine as an acceptor for the language {a^n b^m| n, m>=0 and m>=n}
theory of computation updated 3.8 years ago by teamques10 ★ 70k
1
vote
1
answer
4.5k
views
1
answer
Design PDA to check even parentheses over {0,1}
theory of computation updated 3.8 years ago by teamques10 ★ 70k
0
votes
1
answer
6.2k
views
1
answer
State and explain pumping lemma for regular languages. Using pumping lemma prove that the language L={0^n 1^n | n>=0} is not regular.
theory of computation updated 3.8 years ago by teamques10 ★ 70k
1
vote
1
answer
15k
views
1
answer
Design a turing machine that computes a function f(m,n)=m+n i.e. addition of two integers
theory of computation updated 3.8 years ago by teamques10 ★ 70k
1
vote
1
answer
3.8k
views
1
answer
Design a turing machine to accept the language 0^n 1^n 2^n
theory of computation updated 3.8 years ago by teamques10 ★ 70k
0
votes
1
answer
6.2k
views
1
answer
a. Draw a state diagram and construct a regular expression corresponding to the following state transaction table
theory of computation updated 3.8 years ago by teamques10 ★ 70k
1
vote
1
answer
13k
views
1
answer
State and explain decision properties of regular languages
theory of computation updated 3.8 years ago by teamques10 ★ 70k
2
votes
1
answer
28k
views
1
answer
a. Convert the following CFG to GNF S->AA|a A->SS|b
theory of computation updated 3.8 years ago by teamques10 ★ 70k
0
votes
1
answer
3.4k
views
1
answer
Convert the following NFA to an equivalent DFA
theory of computation updated 3.8 years ago by teamques10 ★ 70k
1
vote
1
answer
3.6k
views
1
answer
Design a PDA corresponding to the grammar S->aSA|E A->bB B->b
theory of computation updated 3.8 years ago by teamques10 ★ 70k
<prev • 104 results • page 1 of 5 • next >