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
3.0k
views
1
answer
Consider the following grammar G = (V, T, P, S), V = {S, X}, T {0, 1} productions P are S is start symbol. Show that above grammar is ambiguous.
theory of computation updated 5.4 years ago by teamques10 ★ 70k
0
votes
1
answer
2.3k
views
1
answer
Prove that Language is not regular.
theory of computation updated 5.4 years ago by teamques10 ★ 70k
1
vote
1
answer
16k
views
1
answer
Explain with an example the Chomsky hierarchy.
theory of computation updated 5.4 years ago by teamques10 ★ 70k
0
votes
1
answer
17k
views
1
answer
Design Moore Machine for the input from (0+ 1 +2) * which print the residue modulo 5 of the input treated as ternary number.
theory of computation updated 5.4 years ago by teamques10 ★ 70k
0
votes
1
answer
13k
views
1
answer
Design Moore Machine to generate output A if string is ending with abb, B if string ending with aba and C otherwise over alphabet (a,b).And Convert it to Mealy machine.
theory of computation updated 5.4 years ago by teamques10 ★ 70k
1
vote
1
answer
15k
views
1
answer
What are the steps to convert a Moore machine to a Mealy machine? Design a Moore machine to convert each occurrence of 100 to 101. Convert it into an equivalent Mealy machine using the above mentioned
theory of computation updated 5.4 years ago by teamques10 ★ 70k
0
votes
1
answer
1.0k
views
1
answer
Compare moore and mearly machine construct moore machine to find out the residue module-3 for binary number
theory of computation updated 5.4 years ago by teamques10 ★ 70k
0
votes
1
answer
1.8k
views
1
answer
Design a mealy machine to determine a residue mod 3 of a binary number
theory of computation updated 5.4 years ago by teamques10 ★ 70k
0
votes
1
answer
1.6k
views
1
answer
Design moore machine for Input $\sum(0,1,2)$ print residue module 5 of input treated as tennary number
theory of computation updated 5.4 years ago by teamques10 ★ 70k
0
votes
1
answer
2.3k
views
1
answer
Design mealy machine to find out 2's complement of binary number
theory of computation updated 5.4 years ago by teamques10 ★ 70k
1
vote
1
answer
4.0k
views
1
answer
Design a more machine to generate output A if string is ended with abb, B if string ending with aba and c otherwise over alphabet (a,b) and convert it into mealy machine
theory of computation updated 5.4 years ago by teamques10 ★ 70k
0
votes
1
answer
1.8k
views
1
answer
convert NFA to DFA
theory of computation updated 5.4 years ago by teamques10 ★ 70k
0
votes
1
answer
2.2k
views
1
answer
convert the following NFA to equivalent DFA
theory of computation updated 5.4 years ago by teamques10 ★ 70k
0
votes
1
answer
1.4k
views
1
answer
Convert following NFA with $\epsilon$ moves to DFA
theory of computation updated 5.4 years ago by teamques10 ★ 70k
1
vote
1
answer
12k
views
1
answer
Design a finite stat machine to determine whether tennary number divisible by 5
theory of computation updated 5.4 years ago by teamques10 ★ 70k
0
votes
1
answer
5.1k
views
1
answer
State and prove pumping lemma for context free languages.
theory of computation updated 5.4 years ago by teamques10 ★ 70k
2
votes
1
answer
31k
views
1
answer
Explain the closure properties of regular languages
theory of computation updated 5.4 years ago by teamques10 ★ 70k
2
votes
1
answer
41k
views
1
answer
Explain the Myhill-Nerode Theorem
theory of computation updated 5.4 years ago by teamques10 ★ 70k
1
vote
1
answer
40k
views
1
answer
Difference between PDA and NPDA
theory of computation updated 7.5 years ago by teamques10 ★ 70k
0
votes
1
answer
1.7k
views
1
answer
convert following $e[psilon$- NFA to NFA without $\epsilon$
theory of computation updated 7.6 years ago by teamques10 ★ 70k
0
votes
1
answer
3.2k
views
1
answer
what is finite automation? Give finite automation m accepting string (a,b)(b a a a)
theory of computation updated 7.6 years ago by teamques10 ★ 70k
0
votes
1
answer
1.1k
views
1
answer
convert the following grammar into finite automata S - ax|by|a|b X - as|by|b y - ax|bs
theory of computation updated 7.6 years ago by teamques10 ★ 70k
1
vote
1
answer
7.3k
views
1
answer
Design finite state machine to add 2 binary numbers of equal length
theory of computation updated 7.6 years ago by teamques10 ★ 70k
0
votes
1
answer
8.8k
views
1
answer
Write Short Notes on
theory of computation updated 9.8 years ago by teamques10 ★ 70k
2
votes
1
answer
24k
views
1
answer
Construct TM to check well formed mess of parenthesis.
theory of computation updated 9.8 years ago by teamques10 ★ 70k
<prev • 104 results • page 4 of 5 • next >