Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged minimal-state-automata
4
votes
2
answers
31
UGC NET CSE | June 2019 | Part 2 | Question: 75
How many states are there in a minimum state automata equivalent to regular expression given below? Regular expression is $a^*b(a+b)$ $1$ $2$ $3$ $4$
How many states are there in a minimum state automata equivalent to regular expression given below?Regular expression is $a^*b(a+b)$$1$$2$$3$$4$
Arjun
4.5k
views
Arjun
asked
Jul 2, 2019
Theory of Computation
ugcnetcse-june2019-paper2
finite-automata
minimal-state-automata
+
–
57
votes
5
answers
32
GATE CSE 2019 | Question: 48
Let $\Sigma$ be the set of all bijections from $\{1, \dots , 5\}$ to $\{1, \dots , 5 \}$, where $id$ denotes the identity function, i.e. $id(j)=j, \forall j$. Let $\circ$ ... Consider the language $L=\{x \in \Sigma^* \mid \pi (x) =id\}$. The minimum number of states in any DFA accepting $L$ is _______
Let $\Sigma$ be the set of all bijections from $\{1, \dots , 5\}$ to $\{1, \dots , 5 \}$, where $id$ denotes the identity function, i.e. $id(j)=j, \forall j$. Let $\circ$...
Arjun
20.1k
views
Arjun
asked
Feb 7, 2019
Theory of Computation
gatecse-2019
numerical-answers
theory-of-computation
finite-automata
minimal-state-automata
difficult
2-marks
+
–
0
votes
1
answer
33
Self Doubt
Find the minimum number of states in the DFA which accept the language of all strings that begin or end with 00 or 11.
Find the minimum number of states in the DFA which accept the language of all strings that begin or end with 00or 11.
kumar.dilip
729
views
kumar.dilip
asked
Jan 19, 2019
Theory of Computation
finite-automata
number-of-dfa
minimal-state-automata
+
–
1
votes
1
answer
34
Applied Course | Mock GATE | Test 1 | Question: 44
Minimum number of states in a deterministic Finite automata that accepts the given language is ______ $L = \{ w \mid w \text{ is any string not in } a^*b^* \}$
Minimum number of states in a deterministic Finite automata that accepts the given language is ______$L = \{ w \mid w \text{ is any string not in } a^*b^* \}$
Applied Course
633
views
Applied Course
asked
Jan 16, 2019
Theory of Computation
applied-course-2019-mock1
numerical-answers
theory-of-computation
finite-automata
minimal-state-automata
+
–
0
votes
0
answers
35
Testbook Test Series: Theory of Computation - Minimal State Automata
$Que-$ The minimum number of states in the $NFA$ for the regular expression $(a + a(b + aa)*b)* a(b + aa)*a$ is ______. Approach ?
$Que-$ The minimum number of states in the $NFA$ for the regular expression $(a + a(b + aa)*b)* a(b + aa)*a$ is ______.Approach ?
Soumya29
550
views
Soumya29
asked
Jan 6, 2019
Theory of Computation
testbook-test-series
theory-of-computation
minimal-state-automata
+
–
0
votes
0
answers
36
[AppliedCourse Test] Min DFA of (a*b*) complement
The Minimum DFA that accepts the given language is ____ L = { w | w is any string not in a*b*}
The Minimum DFA that accepts the given language is ____L = { w | w is any string not in a*b*}
VikramRB
4.1k
views
VikramRB
asked
Jan 5, 2019
Theory of Computation
theory-of-computation
finite-automata
minimal-state-automata
+
–
0
votes
1
answer
37
Self doubt TOC DFA
Construct a minimal DFA which accepts set of all strings over {a,b}, such that $1)$Second symbol from $RHS$ should be $‘a’$ $2)$Third symbol from $RHS$ should be $‘a’$
Construct a minimal DFA which accepts set of all strings over {a,b}, such that$1)$Second symbol from $RHS$ should be $‘a’$$2)$Third symbol from $RHS$ should be $‘a�...
Lakshman Bhaiya
543
views
Lakshman Bhaiya
asked
Dec 27, 2018
Theory of Computation
theory-of-computation
finite-automata
minimal-state-automata
+
–
0
votes
2
answers
38
Minimal DFA
Given following NFA find the minimal equivalent DFA
Given following NFAfind the minimal equivalent DFA
aditi19
1.5k
views
aditi19
asked
Dec 14, 2018
Theory of Computation
theory-of-computation
minimal-state-automata
number-of-states
finite-automata
+
–
3
votes
4
answers
39
ME test series DFA states
The number of states in minimal DFA for strings starting with $ab^{2}$ and ending with $b$ over the alphabet $\left \{ a,b \right \}$ is__________. // doubt: minimal string should be $ abb $ right?
The number of states in minimal DFA for strings starting with $ab^{2}$ and ending with $b$ over the alphabet $\left \{ a,b \right \}$ is__________.// doubt: minimal strin...
Devwritt
1.5k
views
Devwritt
asked
Dec 13, 2018
Theory of Computation
theory-of-computation
number-of-states
minimal-state-automata
+
–
3
votes
1
answer
40
Reversal of DFA doubt
in reversal of DFA if there are more than one final states then which one will be made the initial state? a DFA can have only one initial state
in reversal of DFA if there are more than one final states then which one will be made the initial state? a DFA can have only one initial state
aditi19
2.3k
views
aditi19
asked
Dec 10, 2018
Theory of Computation
theory-of-computation
finite-automata
minimal-state-automata
+
–
5
votes
0
answers
41
Can't understand the intution behind the shortcut
let the ∑ = {0,1} ===> strings possible are should be Binary strings. No.of States in Minimal DFA that accepts, Decimal( Binary String ) = 0 mod n in ACE coaching institute, i learned that For Decimal( Binary String ) = 0 mod n i) if n ... String ) = 0 mod x or 0 mod y neither x divides y nor y divides x either x is divides y or y divides x
let the ∑ = {0,1} === strings possible are should be Binary strings.No.of States in Minimal DFA that accepts, Decimal( Binary String ) = 0 mod n in ACE coaching institu...
Shaik Masthan
926
views
Shaik Masthan
asked
Nov 30, 2018
Theory of Computation
minimal-state-automata
regular-language
+
–
0
votes
1
answer
42
Finite Automata
When we convert a (minimal) NFA to DFA by subset construction method, is the DFA obtained always a minimal DFA? Please elaborate.
When we convert a (minimal) NFA to DFA by subset construction method, is the DFA obtained always a minimal DFA?Please elaborate.
Mizuki
1.0k
views
Mizuki
asked
Nov 14, 2018
Theory of Computation
finite-automata
theory-of-computation
minimal-state-automata
+
–
1
votes
1
answer
43
Doubt DFA
1.The minimum no of state in DFA that accept L={an| n is multiple of 3 but not 5} Ans 15 i did it and found that 3,5 relatively prime so 3*5=15 2.The minimum no of state in DFA that accept L={an| n is multiple of 2 but not 4} Ans 4 and done and found that 2,4 not relatively prime so max(2,4) =4 Can't a Conclude it??? Edited. thanks for rectification.
1.The minimum no of state in DFA that accept L={an| n is multiple of 3 but not 5} Ans 15 i did it and found that 3,5 relatively prime so 3*5=152.The minimum no of st...
Abhisek Tiwari 4
2.4k
views
Abhisek Tiwari 4
asked
Nov 6, 2018
Theory of Computation
finite-automata
minimal-state-automata
number-of-states
+
–
1
votes
1
answer
44
What is the minimal DFA for this language (11+111)*, for Σ={0,1}.
What is the number of states for the above DFA,please draw NFA,DFA and minimised DFA for the same.Also won't the language not accept epsilon?
What is the number of states for the above DFA,please draw NFA,DFA and minimised DFA for the same.Also won't the language not accept epsilon?
sripo
3.0k
views
sripo
asked
Nov 6, 2018
Theory of Computation
theory-of-computation
minimal-state-automata
regular-expression
finite-automata
+
–
0
votes
0
answers
45
Finite Automata
Sambhrant Maurya
479
views
Sambhrant Maurya
asked
Oct 18, 2018
Theory of Computation
finite-automata
theory-of-computation
minimal-state-automata
regular-expression
+
–
1
votes
0
answers
46
Dfa for no states
What is the difference between a dfa accepting epsilon moves and dfa accepting nothing? I have a dfa which has no states what will be the dfa this is regarding,this question https://gateoverflow.in/8362/gate2015-1-52
What is the difference between a dfa accepting epsilon moves and dfa accepting nothing?I have a dfa which has no states what will be the dfa this is regarding,this questi...
sripo
1.3k
views
sripo
asked
Oct 17, 2018
Theory of Computation
minimal-state-automata
theory-of-computation
finite-automata
number-of-states
theory-of-computation-
+
–
0
votes
0
answers
47
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?
For the language which ends with 01 or 11 or 10 or 11 for $\sum$={0,1}* .Is dfa possible for this language?
sripo
392
views
sripo
asked
Oct 16, 2018
Theory of Computation
minimal-state-automata
theory-of-computation
finite-automata
non-determinism
+
–
1
votes
1
answer
48
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.
For the given GrammarS->aA|bBA->bC|aSB->aC|bSC->aB|bA Construct DFA I am getting confused in understanding how to take the final state.
sripo
1.2k
views
sripo
asked
Oct 13, 2018
Theory of Computation
theory-of-computation
finite-automata
regular-grammar
number-of-dfa
minimal-state-automata
+
–
0
votes
0
answers
49
TOC : Minimum State in Finite Automata ( virtualgate )
For a binary string x = a0a1 · · · an−1 define val(x) to be the value of x interpreted as a binary number, where a0 is the most significant bit. More formally, val(x) is given by How many minimum states will be in a finite automaton that accepts exactly the set of binary strings x such that val(x) is divisible by either 4 or 5. Ans is 5 or 20?
For a binary string x = a0a1 · · · an−1 define val(x) to be the value of x interpreted as a binary number, where a0 is the most significant bit. More formally, val(x...
arya_stark
365
views
arya_stark
asked
Oct 12, 2018
Theory of Computation
theory-of-computation
finite-automata
minimal-state-automata
number-of-states
+
–
0
votes
1
answer
50
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_______________
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____...
srestha
1.3k
views
srestha
asked
Oct 6, 2018
Theory of Computation
theory-of-computation
minimal-state-automata
number-of-states
+
–
0
votes
1
answer
51
Test Series
What will be the minimum no. of states for DFA for the above NFA? Please explain.
What will be the minimum no. of states for DFA for the above NFA? Please explain.
Subham Nagar
360
views
Subham Nagar
asked
Sep 23, 2018
Theory of Computation
finite-automata
minimal-state-automata
+
–
1
votes
1
answer
52
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
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) no...
goluabhinan
2.2k
views
goluabhinan
asked
Sep 16, 2018
Theory of Computation
theory-of-computation
finite-automata
minimal-state-automata
+
–
0
votes
1
answer
53
Doubt in Finite Automata
Consider the following DFA D. The number of states in the minimization of D is __________.
Consider the following DFA D.The number of states in the minimization of D is __________.
goluabhinan
1.2k
views
goluabhinan
asked
Sep 11, 2018
Theory of Computation
finite-automata
theory-of-computation
minimal-state-automata
+
–
0
votes
1
answer
54
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 }.
Minimum states required for DFA that accepts : L = {w1 x w2 | w,x belongs to {a,b}* | w1 >= 0, w2 1 and x >= 0 }.
Na462
937
views
Na462
asked
Sep 10, 2018
Theory of Computation
theory-of-computation
minimal-state-automata
number-of-states
+
–
1
votes
0
answers
55
Minimum number of States
Ans. 5
Ans. 5
Na462
1.3k
views
Na462
asked
Aug 30, 2018
Theory of Computation
minimal-state-automata
finite-automata
theory-of-computation
number-of-states
+
–
0
votes
0
answers
56
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
construct the minimul FA, that accepts all the string of 0's and 1'sA)The second symbol from the right end of the string is 0B)The third symbol from the right end of the ...
suraj patel
859
views
suraj patel
asked
Jul 10, 2018
Theory of Computation
finite-automata
theory-of-computation
minimal-state-automata
+
–
0
votes
1
answer
57
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.
Construct the Minimum FA that accepts all the string of 0's and 1's whereA)Every String start and end with Zero.B)Every string Start and end with Same Symbol.
suraj patel
2.5k
views
suraj patel
asked
Jul 10, 2018
Theory of Computation
finite-automata
theory-of-computation
minimal-state-automata
number-of-states
+
–
0
votes
0
answers
58
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)
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)
Harshitha 123
402
views
Harshitha 123
asked
Jun 12, 2018
Theory of Computation
theory-of-computation
minimal-state-automata
finite-automata
number-of-states
+
–
Page:
« prev
1
2
3
4
5
6
7
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register