Ask
Login
TAGGED IN

Automata Theory

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

ALL TAGS
3
votes
1
answer
48k
views
1
answer
State the limitations of Finite Automata
automata theory updated 6.1 years ago by parviagrawal100 • 0
3
votes
1
answer
28k
views
1
answer
Construct TM for accepting Even Palindrome
automata theory updated 4.2 years ago by krithikkm200 • 10
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.2 years ago by teamques10 ★ 70k
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 6.1 years ago by parviagrawal100 • 0
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 6.1 years ago by parviagrawal100 • 0
5
votes
1
answer
16k
views
1
answer
Define Chomsky normal form. Simplify following CFG and convert it into CNF. S-->ASB/e, A-->aAS/a, B-->SbS/A/bb
automata theory updated 4.2 years ago by pg1118329 • 0
0
votes
1
answer
6.2k
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 4.1 years ago by pg1118329 • 0
1
vote
1
answer
9.9k
views
1
answer
Write Short Notes on Chomsky Hierarchy
automata theory updated 5.4 years ago by akshaysainianil • 0
0
votes
1
answer
3.4k
views
1
answer
Give technical strategy to convert CFG to GNF?
automata theory updated 4.2 years ago by krithikkm200 • 10
0
votes
1
answer
6.2k
views
1
answer
Simplification of CFG
automata theory updated 4.2 years ago by krithikkm200 • 10
0
votes
1
answer
11k
views
1
answer
What is Multi-Tape Turing machine
automata theory updated 4.2 years ago by krithikkm200 • 10
1
vote
1
answer
6.6k
views
1
answer
Give formal Definition of Turing Machine?
automata theory updated 4.2 years ago by krithikkm200 • 10
0
votes
1
answer
7.8k
views
1
answer
Short note on Unsolvable Problems
automata theory updated 4.2 years ago by krithikkm200 • 10
1
vote
1
answer
14k
views
1
answer
Recursive and recursively enumerable languages.
automata theory updated 4.2 years ago by krithikkm200 • 10
0
votes
1
answer
3.4k
views
1
answer
Enumerate the differences between finite automata and non-deterministic automata?
automata theory updated 4.2 years ago by krithikkm200 • 10
0
votes
1
answer
3.8k
views
1
answer
State applications where Automata Theory is used.
automata theory updated 4.2 years ago by krithikkm200 • 10
1
vote
1
answer
5.2k
views
1
answer
Explain with example equivalence between NFA and DFA
automata theory updated 4.2 years ago by krithikkm200 • 10
0
votes
1
answer
2.9k
views
1
answer
Design a DFA to accept strings over the alphabet $\sum={a,b}$ containing even number of a s
automata theory updated 4.2 years ago by teamques10 ★ 70k
0
votes
1
answer
6.9k
views
1
answer
Design a DFA to accept
automata theory updated 4.2 years ago by teamques10 ★ 70k
0
votes
1
answer
27k
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.2 years ago by teamques10 ★ 70k
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 6.1 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.2 years ago by teamques10 ★ 70k
0
votes
1
answer
7.0k
views
1
answer
Design a DFA for the regular expression (a+b)*aba
automata theory updated 4.2 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.1 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.2 years ago by teamques10 ★ 70k
<prev • 68 results • page 1 of 3 • next >