Attribution Non-Commercial (BY-NC)

10 views

Attribution Non-Commercial (BY-NC)

- MELJUN CORTES AUTOMATA_LECTURE_Equivalence of Regular Expressions and Finite Automata_Part 2_1
- Lesson Plan Upload Template-Flat
- Calculator Program in J2me
- cse_5_8sem
- Assignment2 Group k
- TH OF COMPUTATION DEC 2002
- R09220504-FORMALLANGUAGESANDAUTOMATATHEORY
- R11 Machine Input Output WorkBook
- 4 Regular Properties
- sudoku(v130608)
- FiniteAutomata
- A Deter Minis Tic Finite Automaton Will Have a Single Possible Output for a Given Input
- 5. Algorithms For Compiler Design.pdf
- [PDF] nfa to dfa c code.docx
- TOC DFA eg
- Final Semester Project Report
- ugcurriculum08
- DVA337-HT17-lecture10.pdf
- Ch. B-LP
- 151720484927528746.pdf

You are on page 1of 4

input symbols, then we get an NFA with -moves, because the transitions made without symbols are called "-transitions." Consider the NFA shown in Figure 1.

Figure 1: Finite automata with -moves. This is an NFA with -moves because it is possible to transition from state q0 to q1 without consuming any of the input symbols. Similarly, we can also transition from state q1 to q2 without consuming any input symbols. Since it is a finite automata, an NFA with -moves will also be denoted as a five-tuple:

where Q, , q0, and F have the usual meanings, and defines a mapping from

A string x in * will -moves will be accepted by the NFA, if at least one path exists that corresponds to x starts in an initial state and ends in one of the final states. But since this path may be formed by -transitions as well as non--transitions, to find out whether x is accepted or not by the NFA with -moves, we must define a function, -closure(q), where q is a state of the automata. The function -closure(q) is defined follows:

-closure(q)= set of all those states of the automata that can be reached from q on a path labeled by . For example, in the NFA with -moves given above: -closure(q0) = { q0, q1, q2} -closure(q1) = { q1, q2} -closure(q2) = { q2}

The function -closure (q) will never be an empty set, because q is always reachable from itself, without dependence on any input symbol; that is, on a path labeled by , q will always exist in -closure(q) on that labeled path. If P is a set of states, then the -closure function can be extended to find -closure(P ), as follows:

Let T be the set that will comprise -closure(q). We begin by adding q to T, and then initialize the stack by pushing q onto stack:

while (stack not empty) do { p = pop (stack) R = (p, ) for every member of R do if it is not present in T then { add that member to T push member of R on stack } }

Since x is a member of *, and there may exist zero, one, or more transitions from a state on an input symbol, we define a new transition function, 1, which defines a mapping from 2Q ?* to 2Q. If x is written as wa, where a is the last symbol of x and w is a string made of remaining symbols of x then:

For example, in the NFA with -moves, given above, if x = 01, then to find out whether x is accepted by the automata or not, we proceed as follows:

Therefore: -closure(1 (-closure (q0), 01) = -closure({q1}) = {q1, q2} Since q2 is a final state, x = 01 is accepted by the automata.

For every NFA with -moves, there exists an equivalent NFA without -moves that accepts the same language. To obtain an equivalent NFA without -moves, given an NFA with -moves, what is required is an elimination of -transitions from a given automata. But simply eliminating the -transitions from a given NFA with -moves will change the language accepted by the automata. Hence, for every -transition to be eliminated, we have to add some non--transitions as substitutes in order to maintain the language's acceptance by the automata. Therefore, transforming an NFA with -moves to and NFA without -moves involves finding the non--transitions that must be added to the automata for every -transition to be eliminated.

Figure 2: Transitioning from an -move NFA to a non--move NFA. There are -transitions from state q0 to q1 and from state q1 to q2. To eliminate these -transitions, we must add a transition on 0 from q0 to q1, as well as from state q0 to q2. Similarly, a transition must be added on 1 from q0 to q1, as well as from state q0 to q2, because the presence of these -transitions in a given automata makes it possible to reach from q0 to q1 on consuming only 0, and it is possible to reach from q0 to q2 on consuming only 0. Similarly, it is possible to reach from q0 to q1 on consuming only 1, and it is possible to reach from q0 to q2 on consuming only 1. It is also possible to reach from q1 to q2 on consuming 0 as well as 1; and therefore, a transition from q1 to q2 on 0 and 1 is also required to be added. Since is also accepted by the given NFA -moves, to accept , and initial state of the NFA without -moves is required to be marked as one of the final states. Therefore, by adding these non--transitions, and by making the initial state one of the final states, we get the automata shown in Figure 3.

Figure 3: Making the initial state of the NFA one of the final states. Therefore, when transforming an NFA with -moves into an NFA without -moves, only the transitions are required to be changed; the states are not required to be changed. But if a given NFA with q0 and -moves accepts (i.e., if the -closure (q0) contains a member of F), then q0 is also required to be marked as one of the final states if it is not already a member of F. Hence: If M = (Q, , , q0, F) is an NFA with -moves, then its equivalent NFA without -moves will be M1 = (Q, , 1, q0, F1) where 1 (q, a) = -closure( ( -closure(q), a)) and

where

where

Since there exists a DFA for every NFA without -moves, and for every NFA with -moves there exists an equivalent NFA without -moves, we conclude that for every NFA with -moves there exists a DFA.

http://programming4.us/desktop/426.aspx

- Lesson Plan Upload Template-FlatUploaded bydasariorama
- Calculator Program in J2meUploaded byMohamed Rafi
- cse_5_8semUploaded bybhushabhusha7949
- R09220504-FORMALLANGUAGESANDAUTOMATATHEORYUploaded bysaiteja1234
- MELJUN CORTES AUTOMATA_LECTURE_Equivalence of Regular Expressions and Finite Automata_Part 2_1Uploaded byMELJUN CORTES, MBA,MPA
- Assignment2 Group kUploaded byVikas Chaganti
- R11 Machine Input Output WorkBookUploaded bykandulasatish
- sudoku(v130608)Uploaded bykurthess
- TH OF COMPUTATION DEC 2002Uploaded byapi-3782519
- 4 Regular PropertiesUploaded byArslan Munir
- FiniteAutomataUploaded bybeenishyousaf7
- A Deter Minis Tic Finite Automaton Will Have a Single Possible Output for a Given InputUploaded byujjal_1971
- 5. Algorithms For Compiler Design.pdfUploaded byMancharagopan
- [PDF] nfa to dfa c code.docxUploaded byShubham Jha
- TOC DFA egUploaded byAtaush Sabuj
- Final Semester Project ReportUploaded byS Bharadwaj Reddy
- ugcurriculum08Uploaded byChinmay Chauhan
- DVA337-HT17-lecture10.pdfUploaded byKamal Walia
- Ch. B-LPUploaded byRaquel Simões
- 151720484927528746.pdfUploaded byEr Kumar
- Penerapan Offensive Volleyball Menggunakan Finite State AutomataUploaded byYuli Cahya
- Automated Design o 00 HarmUploaded byAlex Alex
- Business Models and Information FlowUploaded byMohamed
- Kom Put Project Tu Gasp PtUploaded byNur Rochman Muh
- Assignment 2Uploaded bykhetraj
- Ex_5_3_FSC_part2Uploaded byadnan
- Re Balancing ToleranceUploaded bymorrisonkaniu8283
- SagUploaded bycontretras
- Aes Constant Data TestUploaded byToby Dator
- Una Formulación Matemática y de Solución Para Programar Cirugías Con Restricciones de Recursos Humanos en El Hospital PúblicoUploaded byAlvaro Gomez

- IcebergUploaded bydaniel mella vivanco
- 16_Continuity.pdfUploaded byJashandeep Singh Kochhar
- QuranUploaded byMushtak Mufti
- Math 214 NotesUploaded byLuis Javier Ixtepan
- HCV 2017 Confirmed AgendaUploaded bycharliekonsor
- README.txtUploaded byБиљана Стојаковић
- reflective essayUploaded byapi-356002062
- Saitnt Michael Prayer.pdfUploaded byErick Abarientos
- Ghada Amer's Elaborately Embroidered Paintings, Sculptures, And Installations Add DiscomfitingUploaded byarts374
- Creating a RFC DestinationUploaded bysoma3nath
- Epsilon EpUploaded byIsrael
- Error Raised is Play Modules PDF PDF Cannot Be ResolvedUploaded byTina
- Chapter 6 ChemistryUploaded byparriworld
- F2F Starter SB 2nd EdUploaded byCrina Miriam
- Aix From Strength to StrengthUploaded byimenhidouri
- DHCP With the WLCUploaded byalien420s2k
- Mastering SpellUploaded byanasnasir9
- Nagakumaran ResumeUploaded byNagakumaran Poopandian
- FLOWMETER1204014876.pdfUploaded byWellington Santana
- Comprehension Approach TprUploaded byferhat500
- Os Lab Manual Final Os-2Uploaded byJean Claude
- E G Browne and Yahya AzalUploaded byBVILLAR
- sensitive periodsUploaded byMehakBatla
- 2006 - Golda Akhiezer - The Karaite Isaac Ben Abraham of Troki and His Polemics Against RabbanitesUploaded bybuster301168
- inquiry 1Uploaded byapi-336269876
- DeconstructivismUploaded byVishnu Surapaneni
- kurmanji_1_grammarUploaded bymtustunn
- un4seen - BASS documentationUploaded byNicolas Tsagarides
- Karol WojtylaUploaded byCarlo Emil
- ANTIRELATIVE EVIDENCE OF THE NORMAL LOGICUploaded byConexão Terra Plana