In 29—47, design a finite-state automaton to accept the language defined by the regular expression in the referenced exercise from Section 12.1.
47. Exercise 39
To design and describe a finite −state automaton language by regular expression
Asgiven in the problem that all signed or unsigned number with or without a decimal point.Let represent all digit Th epossible sign of the number are+ and -,The decimal point is represent as /Let us design an automation with 6 states where so is the initial state.Now draw each of the circle with the name of the state within the circle
Bartleby provides explanations to thousands of textbook problems written by our experts, many with advanced degrees!Get Started