MyQuestionIcon

1

You visited us 1 times! Enjoying our articles? Unlock Full Access!

The regular e...

Question

The regular expression for the language recognized by the finite state automation

Open in App

Solution

Since C is dead state so just remove this

Regular expression = RE of A + RE of B

$= 0^{} + 0^{} 11^{}$

= $0^{} (ϵ + 11^{})$

= $0^{} 1^{*}$

Suggest Corrections

thumbs-up

1

Similar questions

Q. Consider the regular expression (0+1) (0+1)_n times. The minimum state finite automation that recognizes the language represented by this regular expression contains

Q. Consider the following finite state Automation

The language accepted by this automation is given by the regular expression

Q. Which regular expression best describes the language accepted by the non-deterministic automation below?

Q. Consider the regular expression:

R = (a + b)^{*} (a a + b b) (a + b)^{*}

Which of the following non-deterministic finite automata recognizes the language defined by the regular expression R ? Edges labeled

λ

denote transition on the empty string.

Q. A minimum state deterministic finite automation accepting the language L =

{w ∣ w ϵ (0, 1)^{*}}

, number of 0s & 1s in w are divisible by 3 and 5, respectively has

View More

Join BYJU'S Learning Program

similar_icon

Related Videos

lock

Characteristics of Particles of Matter

Watch in App

Join BYJU'S Learning Program

CrossIcon