Recent questions tagged minimal-state-automata

0 votes

0 answers

1

Construct DFA for given Language
For the language which ends with 01 or 11 or 10 or 11 for $\sum$={0,1}* .Is dfa possible for this language?

asked 18 hours ago in Theory of Computation by sripo (283 points) | 9 views

0 votes

0 answers

2

Grammar to DFA Construction
For the given Grammar S->aA|bB A->bC|aS B->aC|bS C->aB|bA Construct DFA I am getting confused in understanding how to take the final state.

asked 3 days ago in Theory of Computation by sripo (283 points) | 17 views

0 votes

0 answers

3

TOC : Minimum State in Finite Automata ( virtualgate )

asked 4 days ago in Theory of Computation by arya_stark (365 points) | 15 views

0 votes

1 answer

4

Number of States in TOC
Number of $2$ state DFA with designated initial state can be constructed over alphabet $\sum_{.}^{.}=\left \{ 0,1 \right \}$ and that accept empty language $\Phi$ is_______________

asked Oct 6 in Theory of Computation by srestha Veteran (98.3k points) | 75 views

0 votes

1 answer

5

Test Series
What will be the minimum no. of states for DFA for the above NFA? Please explain.

asked Sep 23 in Theory of Computation by Subham Nagar Junior (669 points) | 40 views

0 votes

0 answers

6

Doubt in Automata
If two finite state machines M and N are isomorphic then M can be transformed to N by relabeling (a) the states alone (b) the edges alone (c) both the states and edges (d) none of the above

asked Sep 16 in Theory of Computation by goluabhinan (101 points) | 10 views

0 votes

1 answer

7

Doubt in Finite Automata
Consider the following DFA D. The number of states in the minimization of D is __________.

asked Sep 12 in Theory of Computation by goluabhinan (101 points) | 46 views

0 votes

1 answer

8

Minimal DFA
Minimum states required for DFA that accepts : L = {w1 x w2 | w,x belongs to {a,b}* | w1 >= 0, w2 > 1 and x >= 0 }.

asked Sep 10 in Theory of Computation by Na462 Loyal (6.4k points) | 35 views

+1 vote

0 answers

9

Minimum number of States
Ans. 5

asked Aug 30 in Theory of Computation by Na462 Loyal (6.4k points) | 61 views

0 votes

1 answer

10

minimum finite automata
construct the minimul FA, that accepts all the string of 0's and 1's A)The second symbol from the right end of the string is 0 B)The third symbol from the right end of the string is 1

asked Jul 10 in Theory of Computation by suraj patel (59 points) | 61 views

0 votes

1 answer

11

Minimum finite automata
Construct the Minimum FA that accepts all the string of 0's and 1's where A)Every String start and end with Zero. B)Every string Start and end with Same Symbol.

asked Jul 10 in Theory of Computation by suraj patel (59 points) | 128 views

0 votes

0 answers

12

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 (99 points) | 72 views

0 votes

1 answer

13

GATE CS Mock 2018 (Set -2)
Let δ denote the transition function and α denoted the extended transition function of the ε-NFA whose transition table is given below: Which of the following option is correct? A) α (q1,aba) is {q0, q2} B) null reachable states are {q0, q1, q2}B C) α (q3,bab) is {q0, q1, q2, q3} D) None of these

asked Jun 11 in Theory of Computation by Nikhil Patil (497 points) | 102 views

0 votes

2 answers

14

Toc DFA

asked Jun 6 in Theory of Computation by Prince Sindhiya Active (3.6k points) | 71 views

0 votes

2 answers

15

Toc dfa
The minimum number of state in the DFA for the language $L = \{ w \mid (n_a(w)+2n_b(w))mod \hspace{0.1cm} 3<2 \} $ is

asked Jun 5 in Theory of Computation by Shivani gaikawad Junior (523 points) | 136 views

+1 vote

2 answers

16

Toc NFa

asked Jun 5 in Theory of Computation by Shivani gaikawad Junior (523 points) | 37 views

0 votes

2 answers

17

Toc DFA
The minimum number of state in the DFA for the language $L = \{ w \mid w \in \{a,b\}^* \text{ w has exactly two a's and at least two b's} \}$ is $9$ $10$ $16$ None

asked Jun 5 in Theory of Computation by Shivani gaikawad Junior (523 points) | 69 views

0 votes

3 answers

18

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) | 153 views

+1 vote

1 answer

19

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) | 92 views

0 votes

1 answer

20

Automata (How to create DFA for the language)

asked May 6 in Theory of Computation by kislaya Pant (165 points) | 100 views

+1 vote

1 answer

21

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 (7.9k points) | 140 views

0 votes

0 answers

22

Minimization of FSM
Is minimization of Finite State Machine(FSM) based on Dynamic Programming(DP) paradigm ? If yes , then what should be the optimal substructure and overlapping subproblems ?

asked Feb 25 in Theory of Computation by ankitgupta.1729 Loyal (7.6k points) | 97 views

+6 votes

2 answers

23

GATE2018-6
Let $N$ be an NFA with $n$ states. Let $k$ be the number of states of a minimal DFA which is equivalent to $N$. Which one of the following is necessarily true? $k \geq 2^n$ $k \geq n$ $k \leq n^2$ $k \leq 2^n$

asked Feb 14 in Theory of Computation by gatecse Boss (18.2k points) | 1.4k views

0 votes

1 answer

24

Minimal DFA
Minimum states if L is Language that accepts (a+b)* (aaa+aab) are ____ My ans : 4 states given ans : 5 states

asked Jan 31 in Theory of Computation by Anjan Active (1.7k points) | 154 views

+2 votes

2 answers

25

How many states in finite automata for the expression L={a^n, where n is a finite number}.

asked Jan 28 in Theory of Computation by Jayant Isswani (67 points) | 174 views

+2 votes

0 answers

26

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 (4k points) | 49 views

+2 votes

1 answer

27

#states DFA
The minimum no of states required to construct a DFA accepting the language of binary strings which contain an equal no of (01) and (10) is

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

+1 vote

1 answer

28

MINIMAL DFA

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

0 votes

0 answers

29

[Madeasy] the minimum number of states in DFA for given language

asked Dec 20, 2017 in Theory of Computation by techbrk3 Junior (509 points) | 100 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