Register

Recent questions tagged finite-automata

1 votes
3 answers
811
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
1 votes
1 answer
815
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
2 votes
1 answer
817
[TOC] Finite automata Infinite language
Some one please explain these two theorems,I am struggling a lot here.
Some one please explain these two theorems,I am struggling a lot here.
User Avatar
0 votes
0 answers
818
Nfa doubt
Tell me any string that is not accepted by option b.
Tell me any string that is not accepted by option b.
User Avatar
0 votes
1 answer
820
TOC Finite automata
If n state finite automata accespts infinite language then what is the length of min, and max. cycle?
If n state finite automata accespts infinite language then what is the length of min, and max. cycle?
User Avatar
3 votes
2 answers
822
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
0 votes
3 answers
826
Ace Test Series: Theory Of Computation - Finite Automata
Simple question. However the question mention MFA or minimal Finite Automation. So can i take NFA as it has 3 states. DFA has four ( 1 extra for the dead state);
Simple question. However the question mention MFA or minimal Finite Automation. So can i take NFA as it has 3 states. DFA has four ( 1 extra for the dead state);
User Avatar
5 votes
2 answers
829
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
830
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
0 votes
0 answers
832
PETER LINZ
Give the regular expression for-( input symbol =a,b) L={w: number of a mod 5>0}
Give the regular expression for-( input symbol =a,b)L={w: number of a mod 5>0}
User Avatar
0 votes
2 answers
834
Finite Automata
Total number of DFA possible with 2 states q0 → start and non-final, q1 → final over Ʃ = {a,b} is (a) 16 (b) 32 (c) 48 (d) 64
Total number of DFA possible with 2 states q0 → start and non-final, q1 → finalover Ʃ = {a,b} is(a) 16 (b) 32(c) 48 (d) 64
User Avatar
2 votes
0 answers
835
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
836
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
0 votes
1 answer
840
nfa theory of computation
The answer to this question is given as 6.
The answer to this question is given as 6.
User Avatar
Page: