Ask
Login
TAGGED IN

Automata Theory

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

ALL TAGS
3
votes
1
answer
27k
views
1
answer
Construct TM for accepting Even Palindrome
automata theory updated 3.2 years ago by pedsangini276 • 4.8k
1
vote
1
answer
6.2k
views
1
answer
Give formal Definition of Turing Machine?
automata theory updated 3.2 years ago by pedsangini276 • 4.8k
0
votes
1
answer
10.0k
views
1
answer
What is Multi-Tape Turing machine
automata theory updated 3.2 years ago by pedsangini276 • 4.8k
1
vote
1
answer
3.6k
views
1
answer
Design a Turing Machine to generate the language given by the regular expression 00*
automata theory updated 3.2 years ago by teamques10 ★ 69k
2
votes
1
answer
12k
views
1
answer
Prove that regular sets are closed under concatenation.
automata theory updated 3.2 years ago by binitamayekar ★ 6.7k
0
votes
1
answer
3.3k
views
1
answer
Using Pumping Lemma, prove that the following language is not regular
automata theory updated 3.2 years ago by sagarkolekar ★ 11k
2
votes
1
answer
2.9k
views
1
answer
Pumping Lemma for regular languages
automata theory updated 3.2 years ago by sagarkolekar ★ 11k
5
votes
1
answer
14k
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 3.2 years ago by binitamayekar ★ 6.7k
0
votes
1
answer
5.0k
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 3.1 years ago by binitamayekar ★ 6.7k
0
votes
1
answer
1.6k
views
1
answer
Find a regular expression corresponding to FA
automata theory updated 5.1 years ago by prashantsaini • 0
0
votes
1
answer
9.2k
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.1 years ago by prashantsaini • 0
0
votes
1
answer
1.9k
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.1 years ago by prashantsaini • 0
5
votes
1
answer
12k
views
1
answer
Design Moore Machine for binary adder
automata theory updated 5.1 years ago by prashantsaini • 0
0
votes
1
answer
9.6k
views
1
answer
Design NFA for binary number divisible by 4 or 6
automata theory updated 5.1 years ago by prashantsaini • 0
0
votes
1
answer
2.7k
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.1 years ago by prashantsaini • 0
3
votes
1
answer
47k
views
1
answer
State the limitations of Finite Automata
automata theory updated 5.1 years ago by prashantsaini • 0
1
vote
1
answer
8.4k
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.1 years ago by prashantsaini • 0
0
votes
1
answer
1.4k
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.1 years ago by prashantsaini • 0
0
votes
1
answer
4.1k
views
1
answer
Give regular expresion and corresponding DFA for all the words that begin and end with double letter
automata theory updated 5.1 years ago by prashantsaini • 0
1
vote
1
answer
14k
views
1
answer
Design a mealy machine for binary adder
automata theory updated 5.1 years ago by prashantsaini • 0
0
votes
1
answer
6.2k
views
1
answer
Design a NFA for a binary number where the first and the last digit is the same
automata theory updated 5.1 years ago by prashantsaini • 0
2
votes
1
answer
4.6k
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.1 years ago by prashantsaini • 0
0
votes
1
answer
5.4k
views
1
answer
State and explain advantages & limitations of regular grammar
automata theory updated 5.1 years ago by prashantsaini • 0
0
votes
1
answer
9.8k
views
1
answer
Short Note on Variants of a Turing Machine
automata theory updated 5.1 years ago by prashantsaini • 0
1
vote
1
answer
8.9k
views
1
answer
Design a Turing Machine to recognize the Language $ L={a^n b^n a^n |n>=1}$
automata theory updated 5.1 years ago by prashantsaini • 0
<prev • 68 results • page 2 of 3 • next >