Ask
Login
TAGGED IN

Automata Theory

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

ALL TAGS
0
votes
1
answer
6.4k
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.0 years ago by pg1118329 • 0
5
votes
1
answer
17k
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.1 years ago by pg1118329 • 0
0
votes
0
answers
965
views
0
answers
(Duplicate) What are Mealy and Moore machine explain Are these machines equivalent if yes then explain with an example to convert Moore to Mealy machine?
automata theory updated 4.1 years ago by mkcomputers2018 • 0
2
votes
1
answer
13k
views
1
answer
Prove that regular sets are closed under concatenation.
automata theory updated 4.1 years ago by pg1118329 • 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.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
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
11k
views
1
answer
What is Multi-Tape Turing machine
automata theory updated 4.1 years ago by krithikkm200 • 10
1
vote
1
answer
6.7k
views
1
answer
Give formal Definition of Turing Machine?
automata theory updated 4.1 years ago by krithikkm200 • 10
3
votes
1
answer
28k
views
1
answer
Construct TM for accepting Even Palindrome
automata theory updated 4.1 years ago by krithikkm200 • 10
0
votes
1
answer
7.8k
views
1
answer
Short note on Unsolvable Problems
automata theory updated 4.1 years ago by krithikkm200 • 10
1
vote
1
answer
14k
views
1
answer
Recursive and recursively enumerable languages.
automata theory updated 4.1 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.1 years ago by krithikkm200 • 10
1
vote
1
answer
5.3k
views
1
answer
Explain with example equivalence between NFA and DFA
automata theory updated 4.1 years ago by krithikkm200 • 10
0
votes
1
answer
3.9k
views
1
answer
State applications where Automata Theory is used.
automata theory updated 4.1 years ago by krithikkm200 • 10
0
votes
1
answer
3.0k
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.1 years ago by teamques10 ★ 70k
0
votes
1
answer
7.0k
views
1
answer
Design a DFA to accept
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
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
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
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
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
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
2
votes
1
answer
10k
views
1
answer
Post Correspondence Problem
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
<prev • 68 results • page 1 of 3 • next >