Ask Experts Questions for FREE Help !
Ask
    sonia12's Avatar
    sonia12 Posts: 3, Reputation: 1
    New Member
    		  
    #1

    Nov 3, 2009, 02:48 AM
    Theory of Automata
    Consider the EVEN-ODD language of strings, defined over ∑= {a,b}, having even number of a’s and odd number of b,s.

    a) Build an FA for the given language
    b) Build a Transition Graph (TG) that accepts the same language but has fewer states than FA.
    c) Find the Regular Expression (RE) corresponding to TG accepting EVEN-ODD language (Show all possible steps)

    last date is 8 nov
    Curlyben's Avatar
    Curlyben Posts: 18,514, Reputation: 1860
    BossMan
    		  
    #2

    Nov 3, 2009, 02:57 AM
    Thank you for taking the time to copy your homework to AMHD.
    Please refer to this announcement: https://www.askmehelpdesk.com/financ...-b-u-font.html
Not your question? Ask your question View similar questions
 

Question Tools Search this Question
Search this Question:

Advanced Search

Add your answer here.


Check out some similar questions!

This is my theory. [ 10 Answers ]

First thing, I assume that light is time. This theory is based on that. If light was time, then it is impossible to go faster then light. The reason is, if light was time, then if we go faster then the speed of light, then that means time stops. And if time stops, we are not going anywhere! ...

Bohr theory vs modern theory [ 2 Answers ]

Can someone explain the differences between the bohr and the modern atomic theories in the description of the electron Thanks :p

View more questions Search