recategorized by
5,442 views
22 votes
22 votes
Give a regular expression over the alphabet $\{0, 1\}$ to denote the set of proper non-null substrings of the string $0110$.
recategorized by

6 Answers

0 votes
0 votes
I think regular expression would be:(0+1+01+10+11+011+110)
–1 votes
–1 votes
Since we have to get only non NULL substrings, hence ∈ should bot be present.

(0 + 1) ( 0 + 1 + ∈) ( 0 + 1 + ∈)

Please correct me if i am wrong
edited by

Related questions

23 votes
23 votes
9 answers
2
makhdoom ghaya asked Nov 14, 2016
5,176 views
Show that the conclusion $(r \to q)$ follows from the premises$:p, (p \to q) \vee (p \wedge (r \to q))$
6 votes
6 votes
1 answer
3
makhdoom ghaya asked Nov 14, 2016
2,448 views
Give a minimal DFA that performs as a $\mod - 3,\;$ $1$'s counter, i.e. outputs a $1$ each time the number of $1$'s in the input sequence is a multiple of $3$.
36 votes
36 votes
8 answers
4
makhdoom ghaya asked Nov 14, 2016
9,857 views
What is the generating function $G(z)$ for the sequence of Fibonacci numbers?