contestada

Construct a regular expression that recognizes the following language of strings over the alphabet {0 1}: The language consisting of the set of all bit strings that contain exactly one 1 and an even number of 0s.

Respuesta :

ibnahmadbello

Answer:

[tex](00)^{*} | (00)^{*}  1 (00)^{*}[/tex]

Step-by-step explanation:

The best way would be to have 00 begin then a 1 and 00; starting with the possibility of 00 or 1 means that we might not get 1 in some formation.

Otras preguntas

Q&A Education