Register

STANFORD CS103 ASSIGNMENT

683 views
1 votes
1 votes
For the alphabet Σ = {0, 1}, construct a DFA for the language L = { w ∈ Σ* | w contains the same number of instances of the substring 01 and the substring 10 }. Note that substrings are allowed to overlap, so 010 ∈ L and 10101 ∈ L.
User Avatar

1 Answer

1 votes
1 votes

It is correct i guess

• edited by
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

2 votes
2 votes
0 answers
1
bj96 asked Apr 7, 2018
801 views
STANFORD cs103
For the alphabet Σ = {0, 1}, prove that if L = { w ∈ Σ*} is a regular language then L1 = { w’ ∈ Σ*} such that w’ is obtained from w in L by flipping one bit of w is also regular.(USING NFA)
For the alphabet Σ = {0, 1}, prove that if L = { w ∈ Σ*} is a regular language then L1 = { w’ ∈ Σ*} such that w’ is obtained from w in L by flipping one bit of...
User Avatar
Link Copied!