Ask
Login
4
votes
1
answer
79k
views
1
answer
Applications of Regular Expression.
theory of computation updated 5.4 years ago by teamques10 ★ 70k
0
votes
1
answer
1.5k
views
1
answer
State and Explain closure properties of Context Free Language.
theory of computation updated 5.4 years ago by teamques10 ★ 70k
0
votes
1
answer
2.8k
views
1
answer
Explain closure properties of CFL
theory of computation updated 5.4 years ago by teamques10 ★ 70k
1
vote
1
answer
5.6k
views
1
answer
State and Explain closure properties of Context Free Language.
theory of computation updated 5.4 years ago by teamques10 ★ 70k
0
votes
1
answer
2.0k
views
1
answer
Convert the following grammar to GNF
theory of computation updated 5.4 years ago by teamques10 ★ 70k
1
vote
1
answer
16k
views
1
answer
Convert the following grammar to GNF
theory of computation updated 5.4 years ago by teamques10 ★ 70k
0
votes
1
answer
6.1k
views
1
answer
Convert the following grammar to GNF
theory of computation updated 5.4 years ago by teamques10 ★ 70k
0
votes
1
answer
1.5k
views
1
answer
Convert the following grammar to GNF
theory of computation updated 5.4 years ago by teamques10 ★ 70k
0
votes
1
answer
3.5k
views
1
answer
2. 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 5.4 years ago by teamques10 ★ 70k
0
votes
1
answer
1.6k
views
1
answer
Convert the following CFG to GNF S->AA|a A->SS|b
theory of computation updated 5.4 years ago by teamques10 ★ 70k
0
votes
1
answer
5.4k
views
1
answer
Convert following Grammar to CNF and GNF.
theory of computation updated 5.4 years ago by teamques10 ★ 70k
1
vote
1
answer
2.2k
views
1
answer
Convert following Grammar to CNF and GNF
theory of computation updated 5.4 years ago by teamques10 ★ 70k
0
votes
1
answer
1.9k
views
1
answer
Show that the following languages are not context free
theory of computation updated 5.4 years ago by teamques10 ★ 70k
1
vote
1
answer
6.2k
views
1
answer
Consider the following grammar
theory of computation updated 5.4 years ago by teamques10 ★ 70k
0
votes
1
answer
9.9k
views
1
answer
For the string aabbabba find the following :
theory of computation updated 5.4 years ago by teamques10 ★ 70k
1
vote
1
answer
7.9k
views
1
answer
Write Short Notes on Chomsky Hierarchy
theory of computation updated 5.4 years ago by teamques10 ★ 70k
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
1
vote
1
answer
9.9k
views
1
answer
Write Short Notes on Chomsky Hierarchy
automata theory updated 5.4 years ago by akshaysainianil • 0
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
<prev • 28,287 results • page 535 of 1132 • next >