Computer Science, asked by kbsairam, 4 months ago

how many states does the regular expression abc+d(a+b) have when represented as NFA using Thompson's algorithm
A. 13 states numbered 0 to 12
B. 12 states numbered 0 to 11
C. 14 states numbered 0 to 13

Answers

Answered by msanchez5489

0

Answer:

a

Explanation:

Answered by durgabhavani6663

0

Answer:

Option A

Hope u understand

Tag me as brainliest

Previous Question

Next Question

Similar questions

Chemistry, 2 months ago

What are Neutrons how are they discover?

English, 2 months ago

how to give answer??

Hindi, 2 months ago

रास्ता डगर आगम लहरा उठा फदम दूर दरख फटिन ना सोच रात 3 2 दिन U साही हुए कुदम उठा कोश एक एक दिन तुझे बुला रही पनि कठिन विषम बढ़ा निहारी तुझे विजय पुकारती नुने रही भारती तुझे बुला और है रहा प्रतीर रक्त डील जिरी तुझे तुझे ना डगर सार्व सुज महान बहा तक्त हुध रहा का प्रस्तुत शीर्षक दिजिए भावार्थ दिजिए।...

Physics, 4 months ago

4. An object is placed at a distance of 10 cm from a concave' mirror of focal length 20 cm. (1) Draw a ray diagram for the formation of image. (ü) Calculate the image distance. (iii) State two characteristics of the image formed.

Math, 4 months ago

If x, y belongs to quadrant3 then-x, y belongs to...

Physics, 9 months ago

Write the material required to observe the types of images and measuring the object distance and image distance from the concare missor .2 marks...

Math, 9 months ago

probability one card is drawn from a well shuffled deck of 52 cards.find the probability 1. a king of red colour 2.a face card 3.a red face card 4.the Jack of hearts 5.a spade 6.the queen of daimonds...

English, 9 months ago

what is a full form of who...