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.2k
views
1
answer
Design a PDA corresponding to the grammar $S =>aSa|bSb|\epsilon$
automata theory updated 2.3 years ago by teamques10 ★ 64k
1
vote
1
answer
15k
views
1
answer
Explain Chomsky Hierarchy
automata theory updated 2.3 years ago by teamques10 ★ 64k
0
votes
1
answer
2.1k
views
1
answer
Explain Turing Machines
automata theory updated 2.3 years ago by teamques10 ★ 64k
0
votes
1
answer
17k
views
1
answer
Convert the following CFG to GNF:
automata theory updated 2.3 years ago by teamques10 ★ 64k
2
votes
1
answer
27k
views
1
answer
Construct a PDA accepting the following Language$L={a^n b^m a^n |m,n>=1}$
automata theory updated 2.3 years ago by teamques10 ★ 64k
0
votes
1
answer
5.5k
views
1
answer
Simplification of CFG
automata theory updated 2.3 years ago by pedsangini276 • 4.7k
0
votes
1
answer
1.8k
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 2.3 years ago by teamques10 ★ 64k
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 ★ 64k
0
votes
1
answer
2.9k
views
1
answer
Give technical strategy to convert CFG to GNF?
automata theory updated 2.3 years ago by pedsangini276 • 4.7k
4
votes
1
answer
12k
views
1
answer
State and explain advantages and limitation of regular and context free grammar.
automata theory updated 2.5 years ago by barunipriyats • 120
1
vote
1
answer
3.2k
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
1
vote
1
answer
8.8k
views
1
answer
Write Short Notes on Chomsky Hierarchy
automata theory updated 3.4 years ago by ninadsail • 10
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.1 years ago by prashantsaini • 0
0
votes
1
answer
1.8k
views
1
answer
Write a necessary function for a given automata
automata theory updated 4.1 years ago by prashantsaini • 0
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.1 years ago by prashantsaini • 0
1
vote
1
answer
8.2k
views
1
answer
Design a Turing Machine to recognize the Language $ L={a^n b^n a^n |n>=1}$
automata theory updated 4.1 years ago by prashantsaini • 0
7
votes
1
answer
9.9k
views
1
answer
Short Note on Halting Problem
automata theory updated 4.1 years ago by prashantsaini • 0
0
votes
1
answer
9.1k
views
1
answer
Short Note on Variants of a Turing Machine
automata theory updated 4.1 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.1 years ago by prashantsaini • 0
0
votes
1
answer
9.2k
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 4.1 years ago by prashantsaini • 0
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.1 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.1 years ago by prashantsaini • 0
1
vote
1
answer
2.2k
views
1
answer
Design CFG for ${a^n} {b^n}$ where n >=1 and convert to Chomsky Normal form.
automata theory updated 4.1 years ago by prashantsaini • 0
0
votes
1
answer
3.7k
views
1
answer
Construct CFG for following :
automata theory updated 4.1 years ago by prashantsaini • 0
0
votes
1
answer
2.6k
views
1
answer
Algorithm for CFG to CNF conversion
automata theory updated 4.1 years ago by prashantsaini • 0
<prev • 68 results • page 2 of 3 • next >