Recent questions tagged minimal-state-automata

+3 votes

3 answers

1

TOC: Number of states in minimum DFA

asked Oct 10 in Theory of Computation by manu00x Veteran (14.9k points) | 96 views

+1 vote

1 answer

2

Theory-of-computation DFA
Design a minimal DFA accepting L={w ; atleast one 'a' in w is not immediately followed by 'b'}

asked Oct 3 in Theory of Computation by MayankSharma (83 points) | 50 views

0 votes

2 answers

3

Deterministic finite Automata
Can anyone help me out to draw a transition diagram for a DFA which accepts the set of strings in which 3rd symbol from RHS is 'a', Σ = {a,b} ??

asked Oct 2 in Theory of Computation by himu243 (11 points) | 37 views

0 votes

0 answers

4

Minimisation of moorey and mealy Machines

asked Sep 24 in Theory of Computation by AnilGoudar Loyal (3.3k points) | 21 views

0 votes

1 answer

5

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

asked Sep 2 in Theory of Computation by Shashi Shekhar 1 (75 points) | 74 views

+1 vote

1 answer

6

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) ?

asked Aug 28 in Theory of Computation by POOJAN SHAH (133 points) | 83 views

+1 vote

1 answer

7

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'?

asked Aug 24 in Theory of Computation by Akash Mishra Junior (679 points) | 70 views

+1 vote

1 answer

8

Min DFA states?
Consider the regular language L=(00+0000)* . The minimum number of states in any DFA accepting this languages is?

asked Aug 18 in Theory of Computation by iarnav Loyal (4.6k points) | 98 views

+1 vote

4 answers

9

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?

asked Aug 6 in Theory of Computation by rahul sharma 5 Veteran (14.8k points) | 130 views

+1 vote

0 answers

10

Number of Final states in minimal FA(NFA)

asked Aug 4 in Theory of Computation by rahul sharma 5 Veteran (14.8k points) | 64 views

+2 votes

1 answer

11

Design DFA
DFA for accepting "00" as substring and rejecting "000" as substring over alphabet {0,1}

asked Jul 19 in Theory of Computation by POOJAN SHAH (133 points) | 118 views

+1 vote

0 answers

12

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.

asked Jul 11 in Theory of Computation by aditya kuppa 1 (123 points) | 51 views

+1 vote

1 answer

13

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!

asked Jan 17 in Theory of Computation by Prajwal Bhat Veteran (12.5k points) | 256 views

+3 votes

2 answers

14

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\}$

asked Jan 10 in Theory of Computation by Lokesh . Veteran (10.6k points) | 158 views

+2 votes

1 answer

15

Counting No of States in the DFA

asked Jan 1 in Theory of Computation by yg92 Loyal (3.2k points) | 180 views

+1 vote

0 answers

16

Minimal DFA
Number of states in Minimal DFA that accepts Language L=$\left \{ ab^* a^* \cup (ab)^* ba\right \}$

asked Dec 26, 2016 in Theory of Computation by Prabhanjan_1 Veteran (12.3k points) | 58 views

+3 votes

2 answers

17

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 ?

asked Dec 25, 2016 in Theory of Computation by Debashish Deka Veteran (56.9k points) | 184 views

+4 votes

1 answer

18

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$

asked Dec 23, 2016 in Theory of Computation by Debashish Deka Veteran (56.9k points) | 165 views

+1 vote

1 answer

19

test book
The minimum number of states required to contruct a DFA accepting languages L= { w | w has an even number of both 0's and 2 's , and an odd number of 1's } over the alphabet $\Sigma =\left \{ 0,1,2,3 \right \}$ is _____ please write regular expression also.

asked Dec 15, 2016 in Theory of Computation by Nishant Arora Loyal (3.2k points) | 184 views

+2 votes

0 answers

20

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 ???

asked Dec 12, 2016 in Theory of Computation by Debashish Deka Veteran (56.9k points) | 101 views

0 votes

0 answers

21

DFA || Linz 2.1 d
$\sum$ = $\left \{ a,b \right \}$ All strings with at least 1 a and exactly 2 b's.

asked Dec 12, 2016 in Theory of Computation by Debashish Deka Veteran (56.9k points) | 125 views

+5 votes

4 answers

22

TOC- DFA
Number of states in DFA which accepts the binary strings divisible by 4 or 5. answer?

asked Dec 8, 2016 in Theory of Computation by Anusha Motamarri Veteran (12.5k points) | 493 views

0 votes

2 answers

23

TOC minimal DFA

asked Dec 4, 2016 in Theory of Computation by Anmol Verma Active (1.5k points) | 152 views

0 votes

1 answer

24

toc dfa
Construct minimal DFA which accepts set of all srings over {a,b} which starts and ends with the same symbol???

asked Nov 27, 2016 in Theory of Computation by Anmol Verma Active (1.5k points) | 111 views

0 votes

0 answers

25

Construction of PDA
Can someone construct a PDA for ai bj where i not equal to 3j+1 ? Is it NPDA or DPDA?

asked Nov 25, 2016 in Theory of Computation by Xylene Loyal (4.3k points) | 84 views

0 votes

1 answer

26

DFA Construction and Minimal State

asked Nov 22, 2016 in Theory of Computation by PEKKA Loyal (2.5k points) | 154 views

+1 vote

3 answers

27

minimised DFA

asked Nov 21, 2016 in Theory of Computation by vaishali jhalani Boss (6.5k points) | 116 views

+1 vote

3 answers

28

NO of states in DFA

asked Nov 19, 2016 in Theory of Computation by vaishali jhalani Boss (6.5k points) | 143 views

0 votes

1 answer

29

DFA minimisation
No of states in the DFA accpeting all the binary strings where no of 0's are divisible by 8 or 4.. What should be the answer..3 or 4?

asked Nov 19, 2016 in Compiler Design by vaishali jhalani Boss (6.5k points) | 45 views

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true

Recent questions tagged minimal-state-automata

Recent Posts

Recent Blog Comments

Recent Badges