Ask
Login
TAGGED IN

Automata Theory

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

ALL TAGS
1
vote
1
answer
6.6k
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 4.2 years ago by prashantsaini • 0
0
votes
1
answer
6.4k
views
1
answer
Construct a Turing Machine accepting palindromes over $\sum$ = {a,b}
automata theory updated 4.2 years ago by prashantsaini • 0
0
votes
1
answer
5.9k
views
1
answer
Design a DFA to accept
automata theory updated 2.3 years ago by teamques10 ★ 65k
2
votes
1
answer
5.9k
views
1
answer
Convert the following CFG to CNF
automata theory updated 2.3 years ago by teamques10 ★ 65k
1
vote
1
answer
5.7k
views
1
answer
Give formal Definition of Turing Machine?
automata theory updated 2.3 years ago by pedsangini276 • 4.8k
0
votes
1
answer
5.5k
views
1
answer
Simplification of CFG
automata theory updated 2.3 years ago by pedsangini276 • 4.8k
0
votes
1
answer
5.3k
views
1
answer
Design a NFA for a binary number where the first and the last digit is the same
automata theory updated 4.2 years ago by prashantsaini • 0
0
votes
1
answer
5.1k
views
1
answer
State and explain advantages & limitations of regular grammar
automata theory updated 4.2 years ago by prashantsaini • 0
0
votes
1
answer
4.9k
views
1
answer
Design a DFA for the regular expression (a+b)*aba
automata theory updated 2.3 years ago by teamques10 ★ 65k
0
votes
1
answer
4.8k
views
1
answer
Design a PDA for CFL that check the well formedness of paranthesis i.e the language of all balanced string of two types of paranthesis ''( )" and " [ ] ".
automata theory updated 4.2 years ago by prashantsaini • 0
0
votes
1
answer
4.7k
views
1
answer
State and explain closure properties of regular languages
automata theory updated 2.3 years ago by teamques10 ★ 65k
1
vote
1
answer
4.6k
views
1
answer
Explain with example equivalence between NFA and DFA
automata theory updated 2.3 years ago by pedsangini276 • 4.8k
0
votes
1
answer
4.5k
views
1
answer
Design a Turing Machine which adds 2 unary numbers and convert the turing machine design to a program
automata theory updated 4.2 years ago by prashantsaini • 0
2
votes
1
answer
4.2k
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 4.2 years ago by prashantsaini • 0
0
votes
1
answer
4.2k
views
1
answer
Design a PDA corresponding to the grammar $S =>aSa|bSb|\epsilon$
automata theory updated 2.3 years ago by teamques10 ★ 65k
0
votes
1
answer
3.8k
views
1
answer
Construct CFG for following :
automata theory updated 4.2 years ago by prashantsaini • 0
0
votes
1
answer
3.7k
views
1
answer
Give regular expresion and corresponding DFA for all the words that begin and end with double letter
automata theory updated 4.2 years ago by prashantsaini • 0
0
votes
1
answer
3.4k
views
1
answer
Give a formal definition of a Push Down Automata(PDA)
automata theory updated 4.2 years ago by prashantsaini • 0
1
vote
1
answer
3.3k
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 2.9 years ago by anushkanipurte • 20
0
votes
1
answer
3.2k
views
1
answer
State applications where Automata Theory is used.
automata theory updated 2.3 years ago by pedsangini276 • 4.8k
1
vote
1
answer
3.1k
views
1
answer
Design a Turing Machine to generate the language given by the regular expression 00*
automata theory updated 2.3 years ago by teamques10 ★ 65k
0
votes
1
answer
3.0k
views
1
answer
Explain the applications of automata ( EM ,PDA , TM) in detail with example
automata theory updated 4.2 years ago by prashantsaini • 0
0
votes
1
answer
3.0k
views
1
answer
Using Pumping Lemma, prove that the following language is not regular
automata theory updated 2.3 years ago by sagarkolekar ★ 11k
0
votes
1
answer
3.0k
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 2.2 years ago by binitamayekar ★ 6.4k
0
votes
1
answer
3.0k
views
1
answer
Let G be the Grammar. Find the leftmost derivation,rightmost derivation and parse tree for the expression a*b+a*b
automata theory updated 2.3 years ago by teamques10 ★ 65k
<prev • 68 results • page 2 of 3 • next >