Ask
Login
TAGGED IN

Automata Theory

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

ALL TAGS
3
votes
1
answer
48k
views
1
answer
State the limitations of Finite Automata
automata theory updated 6.0 years ago by parviagrawal100 • 0
3
votes
1
answer
43k
views
1
answer
Construct a CFG to over {a,b} to accept a set of all palindromes
automata theory updated 4.1 years ago by teamques10 ★ 70k
6
votes
2
answers
36k
views
2
answers
Construct a Mealy machine to accept all strings ending with 00 or 11. Convert the same to Moore Machine (Patrial answer)
automata theory updated 6.0 years ago by parviagrawal100 • 0
2
votes
1
answer
30k
views
1
answer
Construct a PDA accepting the following Language$L={a^n b^m a^n |m,n>=1}$
automata theory updated 4.1 years ago by teamques10 ★ 70k
3
votes
1
answer
28k
views
1
answer
Construct TM for accepting Even Palindrome
automata theory updated 4.1 years ago by krithikkm200 • 10
0
votes
1
answer
28k
views
1
answer
Design a Mealy machine over the alphabet {0,1} which outputs EVEN,ODD according the number of 1 s encountered as even or odd.
automata theory updated 4.1 years ago by teamques10 ★ 70k
0
votes
1
answer
21k
views
1
answer
Design FA for decimal number divisible by 4
automata theory updated 6.0 years ago by teamques10 ★ 70k
0
votes
1
answer
19k
views
1
answer
Convert the following CFG to GNF:
automata theory updated 4.1 years ago by teamques10 ★ 70k
5
votes
1
answer
17k
views
1
answer
Define Chomsky normal form. Simplify following CFG and convert it into CNF. S-->ASB/e, A-->aAS/a, B-->SbS/A/bb
automata theory updated 4.1 years ago by pg1118329 • 0
1
vote
1
answer
16k
views
1
answer
Explain Chomsky Hierarchy
automata theory updated 4.1 years ago by teamques10 ★ 70k
1
vote
1
answer
15k
views
1
answer
Design a mealy machine for binary adder
automata theory updated 6.0 years ago by parviagrawal100 • 0
4
votes
1
answer
15k
views
1
answer
State and explain advantages and limitation of regular and context free grammar.
automata theory updated 4.3 years ago by albakruddin • 0
1
vote
1
answer
14k
views
1
answer
Recursive and recursively enumerable languages.
automata theory updated 4.1 years ago by krithikkm200 • 10
5
votes
1
answer
13k
views
1
answer
Design Moore Machine for binary adder
automata theory updated 6.0 years ago by parviagrawal100 • 0
2
votes
1
answer
13k
views
1
answer
Prove that regular sets are closed under concatenation.
automata theory updated 4.1 years ago by pg1118329 • 0
7
votes
1
answer
12k
views
1
answer
Short Note on Halting Problem
automata theory updated 6.0 years ago by parviagrawal100 • 0
0
votes
1
answer
11k
views
1
answer
What is Multi-Tape Turing machine
automata theory updated 4.1 years ago by krithikkm200 • 10
0
votes
1
answer
11k
views
1
answer
Design PDA for odd length palindrome, let $\sum$ = { 0,1 }, L = { W x $W^R$ where W $\epsilon$ ${\sum}^*$ }
automata theory updated 6.0 years ago by parviagrawal100 • 0
1
vote
1
answer
11k
views
1
answer
Design a NFA accepting input strings that contain either the keyword 000 or 010 and convert it into equivalent DFA.
automata theory updated 6.0 years ago by parviagrawal100 • 0
0
votes
1
answer
10k
views
1
answer
Short Note on Variants of a Turing Machine
automata theory updated 6.0 years ago by parviagrawal100 • 0
0
votes
1
answer
10k
views
1
answer
Design NFA for binary number divisible by 4 or 6
automata theory updated 6.0 years ago by parviagrawal100 • 0
2
votes
1
answer
10k
views
1
answer
Post Correspondence Problem
automata theory updated 4.1 years ago by teamques10 ★ 70k
1
vote
1
answer
10k
views
1
answer
Write Short Notes on Chomsky Hierarchy
automata theory updated 5.3 years ago by akshaysainianil • 0
0
votes
1
answer
10k
views
1
answer
Let G be the grammar. Find the leftmost derivation, rightmost derivation and parse tree for the string 001222.
automata theory updated 6.0 years ago by parviagrawal100 • 0
1
vote
1
answer
9.8k
views
1
answer
Design a Turing Machine to recognize the Language $ L={a^n b^n a^n |n>=1}$
automata theory updated 6.0 years ago by parviagrawal100 • 0
<prev • 68 results • page 1 of 3 • next >