peter linz
a) Find a regular expression and finite automata for all bit strings, with leading bit 1 interpreted as a binary integer, with values not between 10 and 30. b) is L={w1cw2:w1,w2 ={a,b}*,w1!=w2} regular? c)is L={w1cw2:w1,w2 ={a,b}*,w1!=w2^R, with alphabet={a,b,c}
a) Find a regular expression and finite automata for all bit strings, with leading bit 1 interpreted as a binary integer, with values not between 10 and 30.b) is L={w1cw2...
