Ask
Login
TAGGED IN

Automata Theory

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

ALL TAGS
0
votes
1
answer
9.8k
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.7 years ago by parviagrawal100 • 0
0
votes
1
answer
4.4k
views
1
answer
Find the CNF equivalent to
automata theory updated 5.7 years ago by parviagrawal100 • 0
0
votes
1
answer
5.5k
views
1
answer
State and explain advantages & limitations of regular grammar
automata theory updated 5.7 years ago by parviagrawal100 • 0
0
votes
1
answer
21k
views
1
answer
Design FA for decimal number divisible by 4
automata theory updated 5.7 years ago by teamques10 ★ 70k
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.7 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.7 years ago by parviagrawal100 • 0
5
votes
1
answer
13k
views
1
answer
Design Moore Machine for binary adder
automata theory updated 5.7 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.7 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.7 years ago by parviagrawal100 • 0
3
votes
1
answer
48k
views
1
answer
State the limitations of Finite Automata
automata theory updated 5.7 years ago by parviagrawal100 • 0
1
vote
1
answer
10k
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.7 years ago by parviagrawal100 • 0
6
votes
2
answers
36k
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.7 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.7 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.7 years ago by parviagrawal100 • 0
1
vote
1
answer
15k
views
1
answer
Design a mealy machine for binary adder
automata theory updated 5.7 years ago by parviagrawal100 • 0
0
votes
1
answer
6.6k
views
1
answer
Design a NFA for a binary number where the first and the last digit is the same
automata theory updated 5.7 years ago by parviagrawal100 • 0
2
votes
1
answer
4.8k
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.7 years ago by parviagrawal100 • 0
0
votes
1
answer
2.3k
views
1
answer
What is ambiguous grammar ? Find if the following grammar is ambigous or not ?
automata theory updated 6.6 years ago by teamques10 ★ 70k
<prev • 68 results • page 3 of 3 • next >