Ask
Login
TAGGED IN

Automata Theory

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

ALL TAGS
0
votes
1
answer
2.2k
views
1
answer
Explain algorithm for the conversion of a Context Free Grammar(CFG) to Chomsky Normal Form(CNF) and use it to convert the following CFG to CNF:
automata theory updated 4.0 years ago by teamques10 ★ 70k
0
votes
1
answer
19k
views
1
answer
Convert the following CFG to GNF:
automata theory updated 4.0 years ago by teamques10 ★ 70k
0
votes
1
answer
10.0k
views
1
answer
Let G be the grammar. Find the leftmost derivation, rightmost derivation and parse tree for the string 001222.
automata theory updated 5.9 years ago by parviagrawal100 • 0
0
votes
1
answer
4.2k
views
1
answer
Give a formal definition of a Push Down Automata(PDA)
automata theory updated 5.9 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.0 years ago by teamques10 ★ 70k
0
votes
1
answer
5.3k
views
1
answer
Design a PDA corresponding to the grammar $S =>aSa|bSb|\epsilon$
automata theory updated 4.0 years ago by teamques10 ★ 70k
1
vote
1
answer
9.7k
views
1
answer
Design a Turing Machine to recognize the Language $ L={a^n b^n a^n |n>=1}$
automata theory updated 5.9 years ago by parviagrawal100 • 0
0
votes
1
answer
10k
views
1
answer
Short Note on Variants of a Turing Machine
automata theory updated 5.9 years ago by parviagrawal100 • 0
1
vote
1
answer
3.9k
views
1
answer
Design a Turing Machine to generate the language given by the regular expression 00*
automata theory updated 4.0 years ago by teamques10 ★ 70k
0
votes
1
answer
2.5k
views
1
answer
Explain Turing Machines
automata theory updated 4.0 years ago by teamques10 ★ 70k
2
votes
1
answer
10k
views
1
answer
Post Correspondence Problem
automata theory updated 4.0 years ago by teamques10 ★ 70k
1
vote
1
answer
16k
views
1
answer
Explain Chomsky Hierarchy
automata theory updated 4.0 years ago by teamques10 ★ 70k
7
votes
1
answer
11k
views
1
answer
Short Note on Halting Problem
automata theory updated 5.9 years ago by parviagrawal100 • 0
0
votes
1
answer
5.6k
views
1
answer
State and explain advantages & limitations of regular grammar
automata theory updated 5.9 years ago by parviagrawal100 • 0
2
votes
1
answer
4.9k
views
1
answer
Construct a DFA that accepts set of all substrings over the alphabet $\sum={a,b}$ containing wither the substring aaa or bbb
automata theory updated 5.9 years ago by parviagrawal100 • 0
0
votes
1
answer
6.7k
views
1
answer
Design a NFA for a binary number where the first and the last digit is the same
automata theory updated 5.9 years ago by parviagrawal100 • 0
1
vote
1
answer
15k
views
1
answer
Design a mealy machine for binary adder
automata theory updated 5.9 years ago by parviagrawal100 • 0
0
votes
1
answer
1.7k
views
1
answer
Find a regular expression corresponding to FA
automata theory updated 5.9 years ago by parviagrawal100 • 0
0
votes
1
answer
1.5k
views
1
answer
Give a regular expression for language over the alphabets $\sum = {a,b} $ containing at the most two a's
automata theory updated 5.9 years ago by parviagrawal100 • 0
3
votes
1
answer
48k
views
1
answer
State the limitations of Finite Automata
automata theory updated 5.9 years ago by parviagrawal100 • 0
0
votes
1
answer
2.9k
views
1
answer
Write a RE for ${a^n}+{b^m}+{c^k}$ where n+m is odd and k is even.
automata theory updated 5.9 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 5.9 years ago by parviagrawal100 • 0
5
votes
1
answer
13k
views
1
answer
Design Moore Machine for binary adder
automata theory updated 5.9 years ago by parviagrawal100 • 0
0
votes
1
answer
2.0k
views
1
answer
Convert the following RE TO NFA with null moves, then convert it to DFA : ${(0+1)^*} 011 {(0+1)^*}$
automata theory updated 5.9 years ago by parviagrawal100 • 0
0
votes
1
answer
4.3k
views
1
answer
Give regular expresion and corresponding DFA for all the words that begin and end with double letter
automata theory updated 5.9 years ago by parviagrawal100 • 0
<prev • 68 results • page 2 of 3 • next >