Scribd Logo
Fazer o upload

Bem-vindo(a) ao Scribd!

  • Autometa Theory

    Enviado por

    jaigodara
    18 visualizações2 páginas
    This document contains 5 questions related to automata theory for a class test. The questions cover ambiguity in grammars, converting grammars to Chomsky normal form, constructing a pushdown automaton, converting a finite automaton to a regular expression, and simplifying context-free grammars with an example. The test is for 5th semester computer science students, will take 90 minutes, and is out of 20 total marks.

    Descrição original:

    Direitos autorais

    © Attribution Non-Commercial (BY-NC)

    Formatos disponíveis

    DOCX, PDF, TXT ou leia online no Scribd

    Você considera este documento útil?

    Este conteúdo é inapropriado?

    Denunciar este documento
    This document contains 5 questions related to automata theory for a class test. The questions cover ambiguity in grammars, converting grammars to Chomsky normal form, constructing a pushdown automaton, converting a finite automaton to a regular expression, and simplifying context-free grammars with an example. The test is for 5th semester computer science students, will take 90 minutes, and is out of 20 total marks.

    Direitos autorais:

    Attribution Non-Commercial (BY-NC)
    Baixe no formato DOCX, PDF, TXT ou leia online no Scribd
    Sinalizar o conteúdo como inadequado
    18 visualizações2 páginas

    Autometa Theory

    Enviado por

    jaigodara
    This document contains 5 questions related to automata theory for a class test. The questions cover ambiguity in grammars, converting grammars to Chomsky normal form, constructing a pushdown automaton, converting a finite automaton to a regular expression, and simplifying context-free grammars with an example. The test is for 5th semester computer science students, will take 90 minutes, and is out of 20 total marks.

    Direitos autorais:

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

    PRANNATH PARNAMI INSTITUTE OF MANAGEMENT AND TECHNOLOGY, HISAR

    Sessional II Class/ Branch: - 5th Sem. / CSE Sub: - Automata Theory Sub Code: - (CSE-305-E) Time: 90 Mints Max. Marks: 20 Note: Attempt any four questions. All questions carry equal marks. Ques 1: - Explain with example. (A) Ambiguity (B) Left Most and Right Most Derivation. Ques 2: - Convert the following CFG into CNF. S ACA , A aAa | B | C , B bB | b, C cC | e. Ques 3: -Construct a pushdown Automata for L={wcwR |w is in (0+1)*}. Ques 4: - Convert following FA into RE.

    Ques 5: - Explain simplification of CFG with Example.

    PRANNATH PARNAMI INSTITUTE OF MANAGEMENT AND TECHNOLOGY, HISAR


    Sessional II Class/ Branch: - 5th Sem. / CSE Sub: - Automata Theory Sub Code: - (CSE-305-E) Time: 90 Mints Max. Marks: 20 Note: Attempt any four questions. All questions carry equal marks. Ques 1: - Explain with example. (A) Ambiguity (B) Left Most and Right Most Derivation. Ques 2: - Convert the following CFG into CNF. S ACA , A aAa | B | C , B bB | b, C cC | e. Ques 3: -Construct a pushdown Automata for L={wcwR |w is in (0+1)*}. Ques 4: - Convert following FA into RE.

    Ques 5: - Explain simplification of CFG with Example.

    Você também pode gostar