Register

Recent questions tagged finite-automata

1 votes
1 answer
151
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...
User Avatar
2 votes
3 answers
152
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 ?
User Avatar
3 votes
1 answer
154
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...
User Avatar
2 votes
3 answers
155
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)*
User Avatar
20 votes
6 answers
157
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 ___________
User Avatar
15 votes
2 answers
159
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 $...
User Avatar
2 votes
1 answer
168
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...
User Avatar
2 votes
4 answers
169
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
User Avatar
2 votes
3 answers
170
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...
User Avatar
1 votes
4 answers
171
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
User Avatar
1 votes
2 answers
173
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
User Avatar
3 votes
2 answers
178
NIELIT 2016 DEC Scientist B (CS) - Section B: 46
$(00+01+10)(0+1)^*$ represents Strings not starting with $11$ Strings of odd length Strings starting with $00$ Strings of even length
$(00+01+10)(0+1)^*$ representsStrings not starting with $11$Strings of odd lengthStrings starting with $00$Strings of even length
User Avatar
1 votes
1 answer
179
NIELIT 2017 July Scientist B (CS) - Section B: 48
What is the complement of the language accepted by the NFA shown below? $\not{O}$ $\{\epsilon\}$ $a^*$ $\{a,\epsilon\}$ $1$ $2$ $3$ $4$
What is the complement of the language accepted by the NFA shown below?$\not{O}$$\{\epsilon\}$$a^*$$\{a,\epsilon\}$$1$$2$$3$$4$
User Avatar
0 votes
6 answers
180
NIELIT 2017 DEC Scientist B - Section B: 39
Which of the following is true? Mealy and Moore machine are language acceptors. Finite State automata is language translator. NPDA is more powerful than DPDA. Melay machine is more powerful than Moore machine.
Which of the following is true?Mealy and Moore machine are language acceptors.Finite State automata is language translator.NPDA is more powerful than DPDA.Melay machine i...
User Avatar
Page: