Explain the regular expression and transition diagram, Computer Engineering

Assignment Help:

State the relation among Regular Expression, Transition Diagram and Finite State Machines. By using a simple instance establish your claim.  

Answer: For each regular language, we can find out a FSM for this, because a FSM work as recognizer of a regular language. If a language is regular can be ascertained by finding whether a FSM can be drawn or not.  

A machine consists of finite number of states. To find out whether a string is valid or not, the FSM begins scanning the string from start state and moving together the transition diagram according to the current input symbol. The table displaying the movement from one state to other for input symbols of the alphabets is known as transition table.    

Each machine has a unique transition table. So, there is one to one relationship among Regular language and FSM and then between FSM and transition table.


Related Discussions:- Explain the regular expression and transition diagram

What is mini computer, Q. What is Mini computer? The term minicomputer ...

Q. What is Mini computer? The term minicomputer introduced in 1960's when it was realized that numerous computing tasks don't need an expensive modern mainframe computers howev

Can an rc circuit be used as clock source for 8085, Yes, it can be used, if...

Yes, it can be used, if an accurate clock frequency is not needed. Also, the component cost is low contrast to LC or Crystal.

Explain the need for user-defined functions, Explain the need for user-defi...

Explain the need for user-defined functions. The need for user-defined function: 1.  A programmer might be having a block of code that he has repeated forty times all over t

Binary tree can be converted in to its mirror image, A binary tree can be c...

A binary tree can be converted in to its mirror image By traversing it in Preorder

Explain about transmission media, Q. Explain about Transmission Media? ...

Q. Explain about Transmission Media? These, also known as physical channels, can be either bounded or unbounded. Bounded media, in which signals representing data are confined

How can we convert infix expression to a postfix expression, One can change...

One can change an infix expression to a postfix expression using a By using Stack you can convert infix expression to a postfix expression

Define locality of reference, Define locality of reference? What are its ty...

Define locality of reference? What are its types?  During the course of implementation of a program memory references by the processor for both the instruction and the data ten

Main drawbacks of cd-roms, Q. Main drawbacks of CD-ROMs? The main drawb...

Q. Main drawbacks of CD-ROMs? The main drawbacks of CD-ROMs are: It is read only thus can't be updated Access time is longer than that of magnetic disks. Very

Uml, what is uml ?

what is uml ?

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd