Register

Gate 2023
closed

• closed by
1,632 views
0 votes
0 votes
closed as a duplicate of: GATE CSE 2023 | Question: 53
Consider the language L over the alphabet {0, 1}, given below:

L = {w ∈ {0, 1}* | w   does not contain three or more consecutive 1’s}.

 

The minimum number of states in a Deterministic Finite-State Automaton (DFA)
for L is  ______
.
• closed by
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

5 votes
5 votes
1 answer
1
Bikram asked Jan 24, 2017
977 views
Test by Bikram | Mock GATE | Test 2 | Question: 46
The number of possible Deterministic Finite Automation with two states $q_0$ and $q_1$, where $q_0$ is always the initial state over the alphabet $\left \{ a,b \right \}$ which accept empty language is : ____________.
The number of possible Deterministic Finite Automation with two states $q_0$ and $q_1$, where $q_0$ is always the initial state over the alphabet $\left \{ a,b \right \}$...
User Avatar
0 votes
0 votes
1 answer
2
dutta18 asked Sep 22, 2022
1,267 views
GATE CSE 2020
Is this language a regular language ? If yes why and if No why ? The last part is “x!=y” cropped in the picture According to my understanding this is not regular because its says number of x = number of y But Finite automata cant compare the number of x and y here with limited memory. Can you please explain ?
Is this language a regular language ? If yes why and if No why ?The last part is “x!=y” cropped in the pictureAccording to my understanding this is not regular becaus...
User Avatar
0 votes
0 votes
0 answers
4
baofbuiafbi asked Nov 14, 2023
161 views
Michael Sipster Theory of Computation
Prove the language L={(G,H)|G is a CFG, H is a DFA, and L(G)∩L(H)=∅} is undecidable.
Prove the language L={(G,H)|G is a CFG, H is a DFA, and L(G)∩L(H)=∅} is undecidable.
User Avatar
Link Copied!