..........................................NEXT PREVIOUS INDEX
 

 L04 FSA: Another Ex.


                  FSA: Another Example

o  Sheeptalk-2:  Sheep speak in a language in which every sentence:
    -  begins with 'b'
    -  followed by even number of 'a's
    +  Language SheepTalk-2 = {baa, baaaa, ...}
    *  Sheep FSM-2 for above language

                b        a        a
       ->-(q0)-->--(q1)-->--(q2)-->--((q3))
                              \         /
                               \       /
                                ---<---
                                    a

       -  State q2 reached when odd numbers of a's follow b.
       -  q3 when even numbers of a's (and is an accepting state)

o  Sheeptalk-n:  Sentences begin with 'b' followed by prime numbers
   of 'a'.
    -  Not possible to have a FSA for the language 
        -  The task is beyond the power of finite state automata.
..........................................NEXT PREVIOUS INDEX