• edited by
1,482 views
0 0 votes
Give regular expression for all strings not ending with '01' on Σ={0, 1}.

is this expression correct?

(ɛ+1*0*+(0+1)*1*0)*

2 Answers

Position:
Show:

Related questions

2 2 votes
1 1 answer
2.3k
2.3k views
ankit-saha asked Mar 26, 2022
2,296 views
Find a NFA that accepts the complement of the language (ab*aa + bba*ab)
0 0 votes
0 0 answers
549
549 views
Naveen Kumar 3 asked Apr 14, 2019
549 views
Give an unambiguous grammar that generates the set of all regular expressions on $Σ =$ {$a,b$}.
0 0 votes
0 0 answers
633
633 views
Naveen Kumar 3 asked Apr 4, 2019
633 views
Theorem 4.3“Let h be a homomorphism. If L is a regular language, then its homomorphic image h (L) is also regular. The family of regular languages is therefore closed und...
1 1 vote
0 0 answers
468
468 views
Naveen Kumar 3 asked Apr 3, 2019
468 views
Analogous to the previous exercise, consider all words that can be formed from $L$ by droppinga single symbol of the string. Formally define this operation drop for langu...