Recent questions tagged number-of-states

0 votes

0 answers

1

Minimal dfa
How many states will be present in L={w/(n(a) + (2 n(b)mod 3)) lessthan 2} ? (I got 7 states is that correct)

asked Jun 12 in Theory of Computation by Harshitha 123 (87 points) | 28 views

0 votes

2 answers

2

No of states in Minimal DFA
Ques:- Let ∑= {0, 1} What will be the number of states in minimal DFA, if the Binary number string is congruent to (mod 8)? *[ Can anybody explain this as I am getting 8 states for this since remainders will be 8 (0,1,2,3,4,5,6,7). But the answer is 4].

asked May 8 in Theory of Computation by kislaya Pant (165 points) | 92 views

+1 vote

1 answer

3

Minimal Final States in DFA
Ques:- What are the number of final states in minimal DFA, where ∑= {a, b}, if every string starts with “aa” and length of the string is not congruent to 0 (mod 4).

asked May 8 in Theory of Computation by kislaya Pant (165 points) | 70 views

+1 vote

1 answer

4

Number of States in FA
Can number of states in minimized DFA be less than number of states than minimal NFA from which it is converted?

asked Apr 8 in Theory of Computation by smsubham Loyal (6.2k points) | 114 views

0 votes

0 answers

5

Worst Case in NFA to DFA Conversion
Can you give an example of NFA which has n states and its corresponding DFA has 2^n states?

asked Apr 8 in Theory of Computation by smsubham Loyal (6.2k points) | 80 views

+1 vote

2 answers

6

NFA-E to DFA conversion. (which is the correct solution?)

asked Feb 27 in Theory of Computation by ashishgateashish (93 points) | 344 views

+3 votes

1 answer

7

Calculation of number of states in dfa without drwing dfa

asked Jan 15 in Theory of Computation by Sona Barman Active (1.1k points) | 74 views

+2 votes

0 answers

8

minimal dfa
Consider the following grammar: $S\rightarrow aA|bB$ $A\rightarrow aA|bB$ $B\rightarrow bB|ϵ$ Then the number of states in a minimal D.F.A of the above grammar is ______________ ?

asked Jan 15 in Theory of Computation by junk_mayavi Active (3.9k points) | 47 views

+2 votes

0 answers

9

Gate mock test
please explain answer given is 5

asked Jan 4 in Theory of Computation by VIKRAM KASANA (445 points) | 108 views

+2 votes

2 answers

10

#Strings DFA
$ L\ =\ \{\ a^mb^{2n}c^{3n}d^p\ |\ m,n\ >=1\ ,\ p\ >\ m\} \\Find\ the\ number\ of\ strings\ of\ length\ <=\ 13$

asked Dec 31, 2017 in Theory of Computation by Tuhin Dutta Loyal (7.9k points) | 113 views

+1 vote

1 answer

11

MINIMAL DFA

asked Dec 31, 2017 in Theory of Computation by Aakanchha Junior (727 points) | 125 views

0 votes

1 answer

12

minimal Dfa

asked Dec 3, 2017 in Theory of Computation by Parshu gate Active (4.9k points) | 67 views

0 votes

2 answers

13

TOC:- DFA
Consider the following NFA:- How many final states required in the equivalent DFA?

asked Nov 20, 2017 in Theory of Computation by rahul sharma 5 Boss (24.1k points) | 118 views

+1 vote

1 answer

14

Minimum DFA Construction
Construct the minimum DFA accepting language L over {a, b} where the 5th symbol and the 10th symbol from LHS is different. It is given that the minimum DFA has 12 states. But I am getting many more states. Could someone please provide a diagram that involves only 12 states?

asked Nov 17, 2017 in Theory of Computation by humblefool Junior (937 points) | 136 views

+1 vote

0 answers

15

Number of states in DFA
L = {s ∈ (0 + 1)* d(s)mod5 = 2 or d(s)mod7 != 4} where d(s) is the decimal equivalent of the binary string s. How many states does the above DFA have? How many final states? Please explain your answer.

asked Nov 12, 2017 in Theory of Computation by Warlock lord Active (3.4k points) | 85 views

+2 votes

0 answers

16

TOC :- Number of states in DFA
Minimum number of states in DFA where:, Number of a's and Number of b's are even and epsilon is not accepted.Langugae is defined over {a,b}

asked Nov 9, 2017 in Theory of Computation by rahul sharma 5 Boss (24.1k points) | 154 views

0 votes

2 answers

17

NUMBER OF STATES IN DFA

asked Nov 6, 2017 in Theory of Computation by Parshu gate Active (4.9k points) | 135 views

+1 vote

2 answers

18

Number of states in a minimal DFA construction

asked Nov 2, 2017 in Theory of Computation by humblefool Junior (937 points) | 180 views

+2 votes

1 answer

19

#TOC DFA Question
The minimum possible number of states and number of final states of a DFA that accepts the regular language L = {w1aw2 | w1,w2 ∈ {a,b}∗ , |w1|=2,|w2|<=3} is ______________ .

asked Aug 24, 2017 in Theory of Computation by iarnav Loyal (7.2k points) | 243 views

+2 votes

1 answer

20

Number of Final states in minimal FA(NFA)

asked Aug 4, 2017 in Theory of Computation by rahul sharma 5 Boss (24.1k points) | 160 views

+2 votes

1 answer

21

Important Question for number of states in DFA

asked Jul 1, 2017 in Theory of Computation by Shubhanshu Boss (15k points) | 300 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 number-of-states

Recent Posts

Recent Blog Comments