Ask
Login
TAGGED IN

Automata Theory

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

ALL TAGS
0
votes
1
answer
28k
views
1
answer
Design a Mealy machine over the alphabet {0,1} which outputs EVEN,ODD according the number of 1 s encountered as even or odd.
automata theory updated 4.1 years ago by teamques10 ★ 70k
1
vote
1
answer
11k
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 6.0 years ago by parviagrawal100 • 0
0
votes
1
answer
2.8k
views
1
answer
Design a DFA that rejects any string over {1,2,3} where 2 is immediately preceded by a 1. It should accept all other strings.
automata theory updated 4.1 years ago by teamques10 ★ 70k
0
votes
1
answer
7.3k
views
1
answer
Design a DFA for the regular expression (a+b)*aba
automata theory updated 4.1 years ago by teamques10 ★ 70k
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 6.0 years ago by parviagrawal100 • 0
0
votes
1
answer
2.4k
views
1
answer
Convert the following NFA to a reduced DFA(final state is marked by *)
automata theory updated 4.1 years ago by teamques10 ★ 70k
0
votes
1
answer
5.4k
views
1
answer
State and explain closure properties of regular languages
automata theory updated 4.1 years ago by teamques10 ★ 70k
0
votes
1
answer
3.7k
views
1
answer
Using Pumping Lemma, prove that the following language is not regular
automata theory updated 4.1 years ago by phenjoisilab • 0
2
votes
1
answer
3.2k
views
1
answer
Pumping Lemma for regular languages
automata theory updated 4.1 years ago by phenjoisilab • 0
0
votes
1
answer
3.6k
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 4.1 years ago by teamques10 ★ 70k
0
votes
1
answer
2.2k
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 4.1 years ago by teamques10 ★ 70k
0
votes
1
answer
19k
views
1
answer
Convert the following CFG to GNF:
automata theory updated 4.1 years ago by teamques10 ★ 70k
2
votes
1
answer
6.8k
views
1
answer
Convert the following CFG to CNF
automata theory updated 4.1 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 4.1 years ago by teamques10 ★ 70k
2
votes
1
answer
30k
views
1
answer
Construct a PDA accepting the following Language$L={a^n b^m a^n |m,n>=1}$
automata theory updated 4.1 years ago by teamques10 ★ 70k
0
votes
1
answer
5.4k
views
1
answer
Design a PDA corresponding to the grammar $S =>aSa|bSb|\epsilon$
automata theory updated 4.1 years ago by teamques10 ★ 70k
1
vote
1
answer
3.9k
views
1
answer
Design a Turing Machine to generate the language given by the regular expression 00*
automata theory updated 4.1 years ago by teamques10 ★ 70k
0
votes
1
answer
2.5k
views
1
answer
Explain Turing Machines
automata theory updated 4.1 years ago by teamques10 ★ 70k
2
votes
1
answer
10k
views
1
answer
Post Correspondence Problem
automata theory updated 4.1 years ago by teamques10 ★ 70k
1
vote
1
answer
16k
views
1
answer
Explain Chomsky Hierarchy
automata theory updated 4.1 years ago by teamques10 ★ 70k
0
votes
1
answer
5.6k
views
1
answer
State and explain advantages & limitations of regular grammar
automata theory updated 6.0 years ago by parviagrawal100 • 0
2
votes
1
answer
4.9k
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 6.0 years ago by parviagrawal100 • 0
0
votes
1
answer
6.7k
views
1
answer
Design a NFA for a binary number where the first and the last digit is the same
automata theory updated 6.0 years ago by parviagrawal100 • 0
1
vote
1
answer
15k
views
1
answer
Design a mealy machine for binary adder
automata theory updated 6.0 years ago by parviagrawal100 • 0
0
votes
1
answer
1.7k
views
1
answer
Find a regular expression corresponding to FA
automata theory updated 6.0 years ago by parviagrawal100 • 0
<prev • 68 results • page 2 of 3 • next >