Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Some useful problems
Recent questions tagged finite-automata
0
votes
1
answer
151
Self doubt
How many ‘n’ state FA are possible with ‘m’ symbols with – (i) Designated initial state (ii) With designated initial and final state (iii) With no designated initial and final state How can I approach this?
How many ‘n’ state FA are possible with ‘m’ symbols with –(i) Designated initial state(ii) With designated initial and final state(iii) With no designated initi...
Shoto
793
views
Shoto
asked
Dec 28, 2021
Theory of Computation
self-doubt
theory-of-computation
finite-automata
+
–
2
votes
3
answers
152
regular and cfl
if L1 and L2 are not regular language then L1 union L2 is not regular. this statement is true or false? my approach is::: true let suppose L1= a^n b^n AND L2= a^k b^k both are cfl but if we do union then that also be cfl and what happened if union is replaced by concatenation L1 . L2
if L1 and L2 are not regular language then L1 union L2 is not regular.this statement is true or false?my approach is:::true let suppose L1= a^n b^n AND L2= a^k b^kbot...
jugnu1337
1.2k
views
jugnu1337
asked
Dec 23, 2021
Theory of Computation
context-free-language
finite-automata
theory-of-computation
+
–
1
votes
1
answer
153
#self doubt
What will be the answer
What will be the answer
samarpita
580
views
samarpita
asked
Nov 21, 2021
Theory of Computation
theory-of-computation
finite-automata
regular-expression
+
–
1
votes
1
answer
154
Testbook test Series
What will be the number of non-final states in the minimal DFA for the language L = { the set of strings over alphabet (a.b) containing at least three occurrences of 3 consecutive b’s, overlapping permitted}
What will be the number of non-final states in the minimal DFA for the language L = { the set of strings over alphabet (a.b) containing at least three occurrences of 3 co...
Rajat Agrawal007
2.2k
views
Rajat Agrawal007
asked
Nov 18, 2021
Theory of Computation
testbook-test-series
number-of-dfa
finite-automata
+
–
2
votes
3
answers
155
Applied Test Series
Minimum number of states in the DFA of the given language ?
Minimum number of states in the DFA of the given language ?
LRU
537
views
LRU
asked
Nov 2, 2021
Theory of Computation
test-series
theory-of-computation
finite-automata
+
–
0
votes
1
answer
156
DFA that accepts aaa or bbb as substring-: How to make?
https://i.stack.imgur.com/v70kK.jpg I have tried but it is wrong as it accepts abba. What is the correct dfa for this?
https://i.stack.imgur.com/v70kK.jpgI have tried but it is wrong as it accepts abba. What is the correct dfa for this?
shivajikobardan
2.5k
views
shivajikobardan
asked
Nov 1, 2021
Theory of Computation
theory-of-computation
finite-automata
minimal-state-automata
+
–
3
votes
1
answer
157
Number of final states
A FA accepting language L(A) has n states and m transition. ∑ = {a, b} L(A) is given as L(A)={ x | if x ∊ L(A) then u ∊ L(A) for $∃u, v ∊ ∑^{*}$ where x=uv } Find number of final state in above DFA?
A FA accepting language L(A) has n states and m transition. ∑ = {a, b}L(A) is given asL(A)={ x | if x ∊ L(A) then u ∊ L(A) for $∃u, v ∊ ∑^{*}$ where x=uv }Fin...
Nishisahu
367
views
Nishisahu
asked
Oct 8, 2021
Theory of Computation
theory-of-computation
minimal-state-automata
finite-automata
+
–
2
votes
3
answers
158
Regular expressons
The minimum number of states in an equivalent finite automata for the given regular expression are _____ (a(a(a(a(a(ab)*b)*b)*b)*b)*b)*
The minimum number of states in an equivalent finite automata for the given regular expression are _____(a(a(a(a(a(ab)*b)*b)*b)*b)*b)*
coder97
697
views
coder97
asked
Oct 5, 2021
Theory of Computation
theory-of-computation
regular-expression
regular-language
finite-automata
+
–
20
votes
3
answers
159
GATE CSE 2021 Set 2 | Question: 9
Let $L \subseteq \{0,1\}^*$ be an arbitrary regular language accepted by a minimal $\text{DFA}$ with $k$ states. Which one of the following languages must necessarily be accepted by a minimal $\text{DFA}$ with $k$ states? $L-\{01\}$ $L \cup \{01\}$ $\{0,1\}^* – L$ $L \cdot L$
Let $L \subseteq \{0,1\}^*$ be an arbitrary regular language accepted by a minimal $\text{DFA}$ with $k$ states. Which one of the following languages must necessarily be ...
Arjun
9.3k
views
Arjun
asked
Feb 18, 2021
Theory of Computation
gatecse-2021-set2
theory-of-computation
finite-automata
regular-language
1-mark
+
–
20
votes
6
answers
160
GATE CSE 2021 Set 2 | Question: 17
Consider the following deterministic finite automaton $\text{(DFA)}$ The number of strings of length $8$ accepted by the above automaton is ___________
Consider the following deterministic finite automaton $\text{(DFA)}$The number of strings of length $8$ accepted by the above automaton is ___________
Arjun
9.5k
views
Arjun
asked
Feb 18, 2021
Theory of Computation
gatecse-2021-set2
numerical-answers
theory-of-computation
finite-automata
1-mark
+
–
23
votes
3
answers
161
GATE CSE 2021 Set 2 | Question: 28
Suppose we want to design a synchronous circuit that processes a string of $0$'s and $1$'s. Given a string, it produces another string by replacing the first $1$ in any subsequence of consecutive $1$'s by a $0$ ... $\begin{array}{l} t=s+b \\ y=s \overline{b} \end{array}$
Suppose we want to design a synchronous circuit that processes a string of $0$’s and $1$’s. Given a string, it produces another string by replacing the first $1$ in a...
Arjun
8.6k
views
Arjun
asked
Feb 18, 2021
Theory of Computation
gatecse-2021-set2
theory-of-computation
finite-automata
2-marks
+
–
15
votes
2
answers
162
GATE CSE 2021 Set 1 | Question: 38
Consider the following language: $L= \{ w \in \{0,1\}^* \mid w \text{ ends with the substring } 011 \}$ Which one of the following deterministic finite automata accepts $L?$
Consider the following language:$$L= \{ w \in \{0,1\}^* \mid w \text{ ends with the substring } 011 \}$$Which one of the following deterministic finite automata accepts $...
Arjun
4.3k
views
Arjun
asked
Feb 18, 2021
Theory of Computation
gatecse-2021-set1
theory-of-computation
finite-automata
2-marks
+
–
2
votes
1
answer
163
NIELIT 2016 MAR Scientist C - Section C: 32
Two finite state machines are said to be equivalent if they have same number of states have same number of edges have same number of states and edges recognize same set of tokens
Two finite state machines are said to be equivalent if theyhave same number of stateshave same number of edgeshave same number of states and edgesrecognize same set of to...
admin
892
views
admin
asked
Apr 2, 2020
Theory of Computation
nielit2016mar-scientistc
theory-of-computation
finite-automata
+
–
2
votes
4
answers
164
NIELIT 2017 DEC Scientific Assistant A - Section B: 3
The automaton which allows transformation to a new state without consuming any input symbols : $NFA$ $DFA$ $NFA - 1$ All of the options
The automaton which allows transformation to a new state without consuming any input symbols : $NFA$$DFA$$NFA - 1$All of the options
admin
1.7k
views
admin
asked
Mar 31, 2020
Theory of Computation
nielit2017dec-assistanta
theory-of-computation
finite-automata
+
–
2
votes
3
answers
165
NIELIT 2017 DEC Scientific Assistant A - Section B: 4
Complement of a $DFA$ can be obtained by : making starting state as final state. make final as a starting state. making final states non-final and non-final as final. None of the options
Complement of a $DFA$ can be obtained by :making starting state as final state.make final as a starting state.making final states non-final and non-final as final.None of...
admin
1.6k
views
admin
asked
Mar 31, 2020
Theory of Computation
nielit2017dec-assistanta
theory-of-computation
finite-automata
+
–
1
votes
4
answers
166
NIELIT 2017 DEC Scientific Assistant A - Section B: 5
Concatenation Operation refers to which of the following set operations : Union Dot Kleene None of the options
Concatenation Operation refers to which of the following set operations : UnionDotKleeneNone of the options
admin
3.7k
views
admin
asked
Mar 31, 2020
Theory of Computation
nielit2017dec-assistanta
theory-of-computation
finite-automata
+
–
1
votes
2
answers
167
NIELIT 2017 DEC Scientific Assistant A - Section B: 31
A finite automaton accepts which type of language : Type $0$ Type $1$ Type $2$ Type $3$
A finite automaton accepts which type of language : Type $0$Type $1$Type $2$Type $3$
admin
3.4k
views
admin
asked
Mar 31, 2020
Theory of Computation
nielit2017dec-assistanta
theory-of-computation
identify-class-language
finite-automata
+
–
1
votes
2
answers
168
NIELIT 2017 DEC Scientific Assistant A - Section B: 40
What is the relation between $DFA$ and $NFA$ on the basis of computational power ? $DFA$ > $NFA$ $NFA$ > $DFA$ Equal Can't be said
What is the relation between $DFA$ and $NFA$ on the basis of computational power ?$DFA$ $NFA$$NFA$ $DFA$EqualCan't be said
admin
1.0k
views
admin
asked
Mar 31, 2020
Theory of Computation
nielit2017dec-assistanta
theory-of-computation
finite-automata
+
–
1
votes
1
answer
169
NIELIT 2017 DEC Scientific Assistant A - Section B: 50
How many DFA's exits with two states over input alphabet $\left \{ 0,1 \right \}$ $16$ $26$ $32$ $64$
How many DFA's exits with two states over input alphabet $\left \{ 0,1 \right \}$$16$$26$$32$$64$
admin
1.0k
views
admin
asked
Mar 31, 2020
Theory of Computation
nielit2017dec-assistanta
theory-of-computation
finite-automata
number-of-dfa
+
–
2
votes
2
answers
170
NIELIT 2017 DEC Scientific Assistant A - Section B: 60
Finite automata requires minimum ____________ number of stacks. $1$ $0$ $2$ None of the options
Finite automata requires minimum ____________ number of stacks.$1$$0$$2$None of the options
admin
3.7k
views
admin
asked
Mar 31, 2020
Theory of Computation
nielit2017dec-assistanta
theory-of-computation
finite-automata
+
–
3
votes
3
answers
171
NIELIT 2016 DEC Scientist B (CS) - Section B: 1
Palindromes can't be recognized by any Finite State Automata because: FSA cannot remember arbitrarily large amount of information. FSA cannot deterministically fix the midpoint. Even if the mid-Point is known an FSA cannot find whether the second half of the string matches the first half. All of the above.
Palindromes can't be recognized by any Finite State Automata because:FSA cannot remember arbitrarily large amount of information.FSA cannot deterministically fix the midp...
admin
12.2k
views
admin
asked
Mar 31, 2020
Theory of Computation
nielit2016dec-scientistb-cs
theory-of-computation
finite-automata
+
–
2
votes
2
answers
172
NIELIT 2016 DEC Scientist B (CS) - Section B: 24
Given two DFA's $M1$ and $M2$. They are equivalent if $M1$ and $M2$ has the same number of states $M1$ and $M2$ accepts the same language i.e $L(M1)=L(M2)$ $M1$ and $M2$ has the same number of final states None of the above
Given two DFA's $M1$ and $M2$. They are equivalent if$M1$ and $M2$ has the same number of states$M1$ and $M2$ accepts the same language i.e $L(M1)=L(M2)$$M1$ and $M2$ has...
admin
1.5k
views
admin
asked
Mar 31, 2020
Theory of Computation
nielit2016dec-scientistb-cs
theory-of-computation
finite-automata
+
–
Page:
« prev
1
2
3
4
5
6
7
8
9
10
11
...
35
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register