Scribd Logo
Fazer o upload

Bem-vindo(a) ao Scribd!

  • Solution of Spring 2013 - CS402 - 2

    Enviado por

    TMK52
    20 visualizações1 página
    This document contains instructions for Assignment No. 2 for the Theory of Automata course. Students are asked to build an FA (FA3) that accepts words with a double a or ending in b by taking the union of two other FAs (FA1 and FA2) - one for each condition. FA1 accepts words with a double a, FA2 accepts words ending in b. The solution shows the regular expressions and state transitions for FA3, which is the union of FA1 and FA2.

    Descrição original:

    cs402

    Título original

    Solution of Spring 2013_CS402_2

    Direitos autorais

    © Attribution Non-Commercial (BY-NC)

    Formatos disponíveis

    DOC, PDF, TXT ou leia online no Scribd

    Você considera este documento útil?

    Este conteúdo é inapropriado?

    Denunciar este documento
    This document contains instructions for Assignment No. 2 for the Theory of Automata course. Students are asked to build an FA (FA3) that accepts words with a double a or ending in b by taking the union of two other FAs (FA1 and FA2) - one for each condition. FA1 accepts words with a double a, FA2 accepts words ending in b. The solution shows the regular expressions and state transitions for FA3, which is the union of FA1 and FA2.

    Direitos autorais:

    Attribution Non-Commercial (BY-NC)
    Baixe no formato DOC, PDF, TXT ou leia online no Scribd
    Sinalizar o conteúdo como inadequado
    20 visualizações1 página

    Solution of Spring 2013 - CS402 - 2

    Enviado por

    TMK52
    This document contains instructions for Assignment No. 2 for the Theory of Automata course. Students are asked to build an FA (FA3) that accepts words with a double a or ending in b by taking the union of two other FAs (FA1 and FA2) - one for each condition. FA1 accepts words with a double a, FA2 accepts words ending in b. The solution shows the regular expressions and state transitions for FA3, which is the union of FA1 and FA2.

    Direitos autorais:

    Attribution Non-Commercial (BY-NC)
    Baixe no formato DOC, PDF, TXT ou leia online no Scribd
    Sinalizar o conteúdo como inadequado
    de 1

    Assignment No.

    2
    SPRING 2013 CS402 Theory of Automata Mc130200678 Tahir Mahmood MCS 1st Assignment Assignment Statement

    Total Marks: 20 Due Date:

    15 May, 2013

    Following are the two FAs, FA1 accepts all words with a double a in them, and FA2 accepts all words ending in b. Build FA3 that accepts all words that have double a or that end in b. Show all steps

    Solution
    Since the FA1 accepts all words with a double a so its RE is (a+b)*(aa)(a+b)* And FA2 accepts all words ending in b so its RE is (a+b)*b As per given conditions the FA3 has to accept all words that have double a or that end in b. So its the union of FA1 and FA2. Simply FA1 or FA2 means FA1+FA2. i.e., FA3 = FA1+FA2 Old States Z1Z2 Z3a Z2, Z1 Z3 Z3 New States after reading b Z1,Z4 Z4 Z3

    Você também pode gostar