Ask
Login
TAGGED IN

Automata Theory

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

ALL TAGS
1
vote
0
answers
650
views
0
answers
construct pda for s- (s) s/epsilon
automata theory updated 3.5 years ago by yashbeer ★ 11k
0
votes
0
answers
371
views
0
answers
Design a PDA that accepts the following language L {ab" m>n>=1}
automata theory updated 3.4 years ago by bhavishth941 • 10
0
votes
0
answers
527
views
0
answers
Design a PDA that accepts the following languages L=( 0'1"2" | n>=0}
automata theory updated 3.4 years ago by pedsangini276 • 4.8k
1
vote
0
answers
8.4k
views
0
answers
Moore and mealy machine.
automata theory updated 3.4 years ago by pedsangini276 • 4.8k
0
votes
0
answers
519
views
0
answers
Explain in brief 'state table' and 'state graphs'
automata theory updated 3.4 years ago by pedsangini276 • 4.8k
0
votes
0
answers
1.0k
views
0
answers
convert following NFA with $\epsilon$ moves to DFA
automata theory updated 3.3 years ago by teamques10 ★ 69k
0
votes
0
answers
416
views
0
answers
Moore and Mealy machine
automata theory updated 3.1 years ago by rinto2164 • 20
0
votes
0
answers
6.3k
views
0
answers
Design a mealy sequence detector to detect a sequence of 1101 using D flip flops and logic gates. (10)
automata theory updated 3.0 years ago by pedsangini276 • 4.8k
0
votes
0
answers
804
views
0
answers
Converting context-free grammar to chomsky normal form and ait greibach normal form
automata theory updated 3.0 years ago by pedsangini276 • 4.8k
1
vote
0
answers
3.2k
views
0
answers
Construct Mealy machine for (0 + 1)*(00 + 11) and convert to Moore machine
automata theory updated 3.0 years ago by DevarenjiniP • 3.2k
0
votes
0
answers
2.2k
views
0
answers
Convert Regular Expression 01* + 1 to Finite Automata.
automata theory updated 3.0 years ago by DevarenjiniP • 3.2k
<prev • 11 results • page 1 of 1 • next >