Register

Recent questions tagged minimal-state-automata

0 votes
4 answers
91
minimal DFA
construct the minimal DFA for the language L={ 3rd symbol from the R.H.S is 'a'} and ∈={a.b}.
construct the minimal DFA for the language L={ 3rd symbol from the R.H.S is 'a'} and ∈={a.b}.
User Avatar
0 votes
2 answers
93
regular expressions
How many DFA with four states can be constructed over the alphabet ∑= {a, b} with designated initial state? A. 416 * 24 B. 220 C. 216 D. 224
How many DFA with four states can be constructed over the alphabet ∑= {a, b} with designated initial state?A. 416 * 24 B. 220 C. 216 D. 224
User Avatar
1 votes
1 answer
94
TOC DFA
IF a language L(M) over a Σ={a,b} accepts strings ending with b. Language L(N) over a Σ={a,b} accepts strings ending with a. Then what is minimal DFA for L(M) Ո L(N) ?
IF a language L(M) over a Σ={a,b} accepts strings ending with b. Language L(N) over a Σ={a,b} accepts strings ending with a.Then what is minimal DFA for L(M) Ո L(N) ?
User Avatar
3 votes
2 answers
95
#TOC DFA Question
The minimum possible number of states and number of final states of a DFA that accepts the regular language $L = \{w_1aw_2 \mid w_1,w_2 ∈ \{a,b\}^∗, |w_1|=2,|w_2|\leq 3\}$ is ______________ .
The minimum possible number of states and number of final states of a DFA that accepts the regular language $L = \{w_1aw_2 \mid w_1,w_2 ∈ \{a,b\}^∗, |w_1|=2,|w_2|\leq...
User Avatar
1 votes
0 answers
96
Is this minimal DFA correct?
Is this the correct minimal DFA for a language over {a, b}, which accepts set of all strings in which every 'a' is followed by a 'b'?
Is this the correct minimal DFA for a language over {a, b}, which accepts set of all strings in which every 'a' is followed by a 'b'?
User Avatar
1 votes
1 answer
97
Min DFA states?
Consider the regular language L=(00+0000)* . The minimum number of states in any DFA accepting this languages is?
Consider the regular language L=(00+0000)* . The minimum number of states in any DFA accepting this languages is?
User Avatar
1 votes
1 answer
99
Test by Bikram | Theory of Computation | Test 2 | Question: 9
Consider the following transition table of DFA where $q3$ ... The number of states required to represent the same language with minimum number of states automata is _________.
Consider the following transition table of DFA where $q3$ is the final state:$\begin{array}{|c|c|c|} \hline {} & x & y \\ \hline \rightarrow q0 & q1 & q0 \\ \hline q1 & q...
User Avatar
1 votes
1 answer
101
Test by Bikram | Theory of Computation | Test 2 | Question: 6
How many states does the Minimal Finite Automata that accepts all strings of $x$'s and $z$'s (where the number of $x$'s is at least $L$) contain? $L$ states $(L+1)$ states $(L+2)$ states $(L+3)$ states
How many states does the Minimal Finite Automata that accepts all strings of $x$'s and $z$'s (where the number of $x$'s is at least $L$) contain?$L$ states$(L+1)$ states$...
User Avatar
1 votes
3 answers
103
TOC Minimal DFA design
Let language defined is { Number of a's =2 and length of string is atleast 3} over alphabet {a,b}.What are number of states in minimal DFA?
Let language defined is { Number of a's =2 and length of string is atleast 3} over alphabet {a,b}.What are number of states in minimal DFA?
User Avatar
3 votes
1 answer
105
Design DFA
DFA for accepting "00" as substring and rejecting "000" as substring over alphabet {0,1}
DFA for accepting "00" as substring and rejecting "000" as substring over alphabet {0,1}
User Avatar
1 votes
0 answers
106
Thory of automata
Input Alphabet ={0,1}, construct a finite automata (preferably dfa) for a language containing set of all strings such that every block of 5 consecutive symbols contain at least 2 zeroes.
Input Alphabet ={0,1}, construct a finite automata (preferably dfa) for a language containing set of all strings such that every block of 5 consecutive symbols contain at...
User Avatar
1 votes
1 answer
112
Minimum No of states in DFA
No. of states in the DFA accepting the following set of strings are: ( ( aa* + φ* )* (aa* + φ* ) + bb* + φ* φ + φ* )* Quite confusing to me. Share your approach!
No. of states in the DFA accepting the following set of strings are:( ( aa* + φ* )* (aa* + φ* ) + bb* + φ* φ + φ* )*Quite confusing to me. Share your approach!
User Avatar
3 votes
2 answers
113
Minimum states in DFA
Number of final states in minimal DFA where $\sum = \{ a,b \}$ $L = \{ w| n_a(w)mod\ 3 \geq n_b(w)mod\ 2\}$
Number of final states in minimal DFA where $\sum = \{ a,b \}$$L = \{ w| n_a(w)mod\ 3 \geq n_b(w)mod\ 2\}$
User Avatar
1 votes
1 answer
115
Minimal DFA
Number of states in Minimal DFA that accepts Language L=$\left \{ ab^* a^* \cup (ab)^* ba\right \}$
Number of states in Minimal DFA that accepts Language L=$\left \{ ab^* a^* \cup (ab)^* ba\right \}$
User Avatar
5 votes
2 answers
116
Minimal DFA
$L_1 = \left \{ w \;\; | \;\; d(w) \text{ mod} \; 8 = 0 \right \}$ $L_2 = \left \{ w \;\; | \;\; d(w) \text{ mod} \; 4 = 0 \right \}$ $d(w) = \text{decimal value of binary string w}$ Minimum no of states in both the cases ?
$L_1 = \left \{ w \;\; | \;\; d(w) \text{ mod} \; 8 = 0 \right \}$$L_2 = \left \{ w \;\; | \;\; d(w) \text{ mod} \; 4 = 0 \right \}$$d(w) = \text{decimal value of binary ...
User Avatar
4 votes
1 answer
117
Minimal DFA
$\begin{align*} \large\color{green}{L_1 = L\left ( a^{*}bb \right ) \cup L\left ( ab^{*}ba \right ) } \\ \end{align*}$ Minimal DFA for $L_1$
$$\begin{align*} \large\color{green}{L_1 = L\left ( a^{*}bb \right ) \cup L\left ( ab^{*}ba \right ) } \\ \end{align*}$$Minimal DFA for $L_1$
User Avatar
2 votes
0 answers
119
DFA || Linz
$\sum = \left \{ a,b \right \}$ All strings with exactly two a's and more than one b. I did in the following way : Please verify if further minimization possible.Or any other method ???
$\sum = \left \{ a,b \right \}$ All strings with exactly two a's and more than one b.I did in the following way :Please verify if further minimization possible.Or any oth...
User Avatar
0 votes
0 answers
120
DFA || Linz 2.1 d
$\sum$ = $\left \{ a,b \right \}$ All strings with at least 1 a and exactly 2 b's.
$\sum$ = $\left \{ a,b \right \}$All strings with at least 1 a and exactly 2 b's.
User Avatar
Page: