Scribd Logo
Upload

Welcome to Scribd!

  • Problema 1 AFN AFD. Puteam Sa Consideram Ca Nu Avem - Tranzitii Cercul Dublu Stare Finală. Afn

    Uploaded by

    Vlad Chichirau
    9 views2 pages
    This document discusses four problems related to finite automata: 1) Converting an NFA to an equivalent DFA 2) Converting regular expressions to equivalent finite automata 3) Converting finite automata to equivalent regular expressions 4) Minimizing a finite automaton It provides examples and links to additional online resources for problems 1-3.

    Original Description:

    Teste

    Original Title

    Tema 2 - Teste

    Copyright

    © © All Rights Reserved

    Available Formats

    DOC, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document discusses four problems related to finite automata: 1) Converting an NFA to an equivalent DFA 2) Converting regular expressions to equivalent finite automata 3) Converting finite automata to equivalent regular expressions 4) Minimizing a finite automaton It provides examples and links to additional online resources for problems 1-3.

    Copyright:

    © All Rights Reserved
    Download as DOC, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    9 views2 pages

    Problema 1 AFN AFD. Puteam Sa Consideram Ca Nu Avem - Tranzitii Cercul Dublu Stare Finală. Afn

    Uploaded by

    Vlad Chichirau
    This document discusses four problems related to finite automata: 1) Converting an NFA to an equivalent DFA 2) Converting regular expressions to equivalent finite automata 3) Converting finite automata to equivalent regular expressions 4) Minimizing a finite automaton It provides examples and links to additional online resources for problems 1-3.

    Copyright:

    © All Rights Reserved
    Download as DOC, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 2

    Problema 1

    AFN => AFD. Puteam sa consideram ca nu avem


    Cercul dublu = stare final.

    -tranzitii

    AFN :

    AFD:

    Sau exemplul 2 de aici :


    http://www.cs.odu.edu/~toida/nerzic/390teched/regular/fa/nfa-2-dfa.html

    Problema 2
    Expresie Regulata => Automat finit
    - abb*bba
    - ab (a|b) bba
    - ab* U bba* (reuniune)

    Problema 3.
    Automat Finit => Expresie Regulata

    Rezulatul :

    Problema 4.
    Minimizarea

    http://www.google.ro/url?
    sa=t&rct=j&q=&esrc=s&source=web&cd=1&cad=rja&uact=8&ved=0CCw
    QFjAA&url=http%3A%2F%2Fdavos.science.upm.ro%2F~apetrescu
    %2FOLD%2Fpublic_html%2FCurs%2520LFA%2F2.3.Minimizarea
    %2520unui%2520automat
    %2520finit.doc&ei=xfE6U8raIabp4wS1zIGIDA&usg=AFQjCNEi9jcB3WpUY61a5tL9maNoVy_yw&sig2=FHOzAusD0RNEjCMw1KSwPw&bv
    m=bv.63934634,d.bGQ
    2

    You might also like