Register

Recent questions tagged finite-automata

0 votes
2 answers
781
theory of computation
Give regular expression for the complement of the language given below . L (r) = {a2nb2m+1: n ≥ 0, m ≥ 0} (or) r =(aa)* (bb)* b
Give regular expression for the complement of the language given below .L (r) = {a2nb2m+1: n ≥ 0, m ≥ 0} (or) r =(aa)* (bb)* b
User Avatar
0 votes
1 answer
782
theory of computation
Give a regular expression for LR, where L is the language given below, L = (a + b) b (a + ab)* My answer : ( a + ba )* b ( a + b ). Please verify ...
Give a regular expression for LR, where L is the language given below,L = (a + b) b (a + ab)*My answer : ( a + ba )* b ( a + b ).Please verify ...
User Avatar
0 votes
1 answer
783
theory of computation
The DFA for the complement of the language accepted by the above NFA is which is the answer ??? A) or B) ??? I feel B) is not a DFA and so A) is the answer ... please correct me if am wrong ...
The DFA for the complement of the language accepted by the above NFA is which is the answer ??? A) or B) ??? I feel B) is not a DFA and so A) is the answer ... please c...
User Avatar
1 votes
2 answers
784
theory of computation
For the nfa given below, find δ*(q0, 1010) and δ* (q1,00).
For the nfa given below, find δ*(q0, 1010) and δ* (q1,00).
User Avatar
2 votes
3 answers
785
theory of computation
Construct minimal DFA for L = {an: n is either a multiple of three or a multiple of 5 }
Construct minimal DFA for L = {an: n is either a multiple of three or a multiple of 5 }
User Avatar
0 votes
1 answer
787
theory of computation
Let sigma = {0,1} . Construct a dfa for "All strings containing 00 but not 000".
Let sigma = {0,1} . Construct a dfa for "All strings containing 00 but not 000".
User Avatar
0 votes
1 answer
789
theory od computation
Find DFA for the language,L= {w: |w| mod 3 = 0, |w| ≠6}
Find DFA for the language,L= {w: |w| mod 3 = 0, |w| ≠6}
User Avatar
0 votes
1 answer
790
theory of computation
Find dfa's for the following languages on Σ = {a,b}. L= {w: na(w) mod 3 >nb(w) mod 3}. L= {w :(na(w) – nb(w)) mod 3 > 0}.
Find dfa's for the following languages on Σ = {a,b}.L= {w: na(w) mod 3 >nb(w) mod 3}.L= {w :(na(w) – nb(w)) mod 3 0}.
User Avatar
3 votes
2 answers
791
theoryof computation
Both these languages are not equivalent...right ???
Both these languages are not equivalent...right ???
User Avatar
0 votes
1 answer
793
theory of computation
Let sigma = { a,b }. The minimal number of states in a DFA that accepts set of all strings with A) exactly 2 "a's" and more than 2 "b's". B) atleast one "a" and exactly 2 "b's" .
Let sigma = { a,b }. The minimal number of states in a DFA that accepts set of all strings with A) exactly 2 "a's" and more than 2 "b's". B) atleast one "a" and e...
User Avatar
4 votes
3 answers
794
How many DFAs are possible?
How many 3 state DFA's can be constructed with a designated initial final state that accepts empty language over alphabet {a,b}?
How many 3 state DFA's can be constructed with a designated initial final state that accepts empty language over alphabet {a,b}?
User Avatar
0 votes
1 answer
796
Designing DFA's
Design a DFA which accepts all strings over { a, b } that doesn't contain string aabb in it.
Design a DFA which accepts all strings over { a, b } that doesn't contain string aabb in it.
User Avatar
0 votes
2 answers
798
Peter Linz Exercise 3.2
GIve a DFA that accepts the following language : L(ab(a+ab)*(a+aa)) What could be the minimum number of states in such DFA?
GIve a DFA that accepts the following language :L(ab(a+ab)*(a+aa))What could be the minimum number of states in such DFA?
User Avatar
1 votes
2 answers
799
NFA vs DFA
While constructing state diagram with minimum states, dead state is compulsory for: a) Only DFA b) Only NFA c) Both NFA and DFA d) Neither DFA nor NFA
While constructing state diagram with minimum states, dead state is compulsory for:a) Only DFAb) Only NFAc) Both NFA and DFAd) Neither DFA nor NFA
User Avatar
4 votes
3 answers
800
ISI 2015 PCB C4 B
Draw a 4-state DFA for the language $L \subseteq$ {a,b}* , L = {x : the number of time ab appears in x is even}
Draw a 4-state DFA for the language $L \subseteq$ {a,b}* , L = {x : the number of time ab appears in x is even}
User Avatar
0 votes
1 answer
801
introduction to computer theory second edition by daniel chapter 5 question 14 (ii)
build an fa that accepts language of all strings of length 4 or more such that next to last (second last) letter is equal to the second letter of input string
build an fa that accepts language of all strings of length 4 or more such that next to last (second last) letter is equal to the second letter of input string
User Avatar
77 votes
12 answers
802
GATE CSE 2017 Set 2 | Question: 39
Let $\delta$ denote the transition function and $\widehat{\delta}$ denote the extended transition function of the $\epsilon$ ... $\emptyset$ $\{q_0, q_1, q_3\}$ $\{q_0, q_1, q_2\}$ $\{q_0, q_2, q_3 \}$
Let $\delta$ denote the transition function and $\widehat{\delta}$ denote the extended transition function of the $\epsilon$-NFA whose transition table is given below:$$\...
User Avatar
2 votes
0 answers
808
dfa gatebook QS
User Avatar
1 votes
3 answers
810
No. of DFA's Possible
The number of different DFA's with two states X and Y,where X is the initial state,over the alphabet $\sum$ = {0,1,2}
The number of different DFA's with two states X and Y,where X is the initial state,over the alphabet $\sum$ = {0,1,2}
User Avatar
Page: