Ask
Login
TAGGED IN

Automata Theory

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

ALL TAGS
0
votes
1
answer
4.0k
views
1
answer
Give a formal definition of a Push Down Automata(PDA)
automata theory updated 5.3 years ago by prashantsaini • 0
7
votes
1
answer
11k
views
1
answer
Short Note on Halting Problem
automata theory updated 5.3 years ago by prashantsaini • 0
1
vote
1
answer
3.7k
views
1
answer
Write a right linear grammar and left linear grammar for RE (0+1)*0 and show derivation tree for 1010110
automata theory updated 4.1 years ago by anushkanipurte • 20
1
vote
1
answer
9.7k
views
1
answer
Write Short Notes on Chomsky Hierarchy
automata theory updated 4.6 years ago by ninadsail • 10
0
votes
1
answer
2.1k
views
1
answer
Write a necessary function for a given automata
automata theory updated 5.3 years ago by prashantsaini • 0
4
votes
1
answer
15k
views
1
answer
State and explain advantages and limitation of regular and context free grammar.
automata theory updated 3.7 years ago by barunipriyats • 120
2
votes
1
answer
12k
views
1
answer
Prove that regular sets are closed under concatenation.
automata theory updated 3.4 years ago by binitamayekar ★ 6.7k
0
votes
1
answer
5.8k
views
1
answer
Give an algorithm for a Turing machine that recognizes the language containing all palindromes over the alphabet {a,b} whose length is an even number.
automata theory updated 3.3 years ago by binitamayekar ★ 6.7k
0
votes
0
answers
837
views
0
answers
(Duplicate) What are Mealy and Moore machine explain Are these machines equivalent if yes then explain with an example to convert Moore to Mealy machine?
automata theory updated 3.4 years ago by nehetiw974 • 30
0
votes
1
answer
9.7k
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.3 years ago by prashantsaini • 0
1
vote
1
answer
9.2k
views
1
answer
Design a Turing Machine to recognize the Language $ L={a^n b^n a^n |n>=1}$
automata theory updated 5.3 years ago by prashantsaini • 0
5
votes
1
answer
15k
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 3.4 years ago by binitamayekar ★ 6.7k
0
votes
1
answer
10k
views
1
answer
Short Note on Variants of a Turing Machine
automata theory updated 5.3 years ago by prashantsaini • 0
0
votes
1
answer
4.2k
views
1
answer
Give regular expresion and corresponding DFA for all the words that begin and end with double letter
automata theory updated 5.3 years ago by prashantsaini • 0
0
votes
1
answer
2.2k
views
1
answer
What is ambiguous grammar ? Find if the following grammar is ambigous or not ?
automata theory updated 6.2 years ago by teamques10 ★ 70k
1
vote
1
answer
2.7k
views
1
answer
Design CFG for ${a^n} {b^n}$ where n >=1 and convert to Chomsky Normal form.
automata theory updated 5.3 years ago by prashantsaini • 0
0
votes
1
answer
4.9k
views
1
answer
Construct CFG for following :
automata theory updated 5.3 years ago by prashantsaini • 0
0
votes
1
answer
5.5k
views
1
answer
State and explain advantages & limitations of regular grammar
automata theory updated 5.3 years ago by prashantsaini • 0
2
votes
1
answer
4.7k
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.3 years ago by prashantsaini • 0
0
votes
1
answer
1.6k
views
1
answer
Find a regular expression corresponding to FA
automata theory updated 5.3 years ago by prashantsaini • 0
0
votes
1
answer
1.9k
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.3 years ago by prashantsaini • 0
1
vote
1
answer
14k
views
1
answer
Design a mealy machine for binary adder
automata theory updated 5.3 years ago by prashantsaini • 0
0
votes
1
answer
2.8k
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.3 years ago by prashantsaini • 0
3
votes
1
answer
47k
views
1
answer
State the limitations of Finite Automata
automata theory updated 5.3 years ago by prashantsaini • 0
1
vote
1
answer
9.9k
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 5.3 years ago by prashantsaini • 0
<prev • 68 results • page 1 of 3 • next >