IAintaBlonde.com

Automata and Formal Languages (Discussion Page)

Good material here

powered by performancing firefox

Related Articles:

This entry was posted on Wednesday, March 7th, 2007 at 11:38 am and is filed under Automata Theory: Peter Linz. You can follow any responses to this entry through the RSS 2.0 feed. You can leave a response, or trackback from your own site.

4 Responses to Automata and Formal Languages (Discussion Page) »»


Comments

  • Hi, Hope your exam is over. Can you Please send me the exercise solutions ?

  • Hi All!

    Was away on Spring Break! So needed the break!

    Will have to scan stuff today..Will upload by EOD ..

  • Finally its done! Here are all the solutions sorted at : Previous post

  • I need a tutor for this course,
    I just need a sessions over the phone, willing pay well for the help
    PLEASE…… before i pull my hair out.

    Example of questions.
    Let L = {ac, ca, cc}. Which of the following strings is in L*?
    a. aaccaa
    b. caacccca
    c. ccacaa
    d. accac

    Consider the following grammar:
    S -> aaA
    A -> aD | bD
    D -> dD | d
    Which of the following sentences can be derived from this grammar?
    a. bdd
    b. aaddd
    c. aaabdd
    d. aabddd


Leave a Reply »»

Close
E-mail It