Consider the regular expression $$0 ^ { * } 10 ^ { * } \mid 0 ^ { * } 10 ^ { * } 10 ^ { * }$$
(a) Describe the language deﬁned by this expression.
(b) Design a ﬁnite-state automaton to accept the language deﬁned by the expression.

Question

Consider the regular expression $$0 ^ { * } 10 ^ { * } \mid 0 ^ { * } 10 ^ { * } 10 ^ { * }$$ 
(a) Describe the language deﬁned by this expression.
(b) Design a ﬁnite-state automaton to accept the language deﬁned by the expression.

Quizplus · Accepted Answer

The Answer is a. The language accepted by the automaton is the set of all strings of 0 's and 1 's that contain exactly one 1 or that contain exactly two 1 's.
b.

a. The language accepted by the automaton is the set of all strings of 0 's and 1 's that contain exactly one 1 or that contain exactly two 1 's. b.

Consider the Regular Expression 0∗10∗∣0∗10∗10∗0 ^ { * } 10 ^ { * } \mid 0 ^ { * } 10 ^ { * } 10 ^ { * }0∗10∗∣0∗10∗10∗

Consider the Regular Expression $0 ^ { * } 10 ^ { * } \mid 0 ^ { * } 10 ^ { * } 10 ^ { * }$