Ask
Login
TAGGED IN

Automata Theory

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

ALL TAGS
2
votes
1
answer
6.6k
views
1
answer
Convert the following CFG to CNF
automata theory updated 3.5 years ago by teamques10 ★ 70k
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 3.5 years ago by teamques10 ★ 70k
3
votes
1
answer
27k
views
1
answer
Construct TM for accepting Even Palindrome
automata theory updated 3.5 years ago by pedsangini276 • 4.8k
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
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
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
4.2k
views
1
answer
Find the CNF equivalent to
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
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
5
votes
1
answer
12k
views
1
answer
Design Moore Machine for binary adder
automata theory updated 5.3 years ago by prashantsaini • 0
0
votes
1
answer
9.8k
views
1
answer
Design NFA for binary number divisible by 4 or 6
automata theory updated 5.3 years ago by prashantsaini • 0
0
votes
1
answer
9.6k
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
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
6
votes
2
answers
35k
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 5.3 years ago by prashantsaini • 0
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
1
answer
1.6k
views
1
answer
Find a regular expression corresponding to FA
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
6.5k
views
1
answer
Design a NFA for a binary number where the first and the last digit is the same
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
5.5k
views
1
answer
State and explain advantages & limitations of regular grammar
automata theory updated 5.3 years ago by prashantsaini • 0
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
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
<prev • 68 results • page 1 of 3 • next >