## Are you sure?

This action might not be possible to undo. Are you sure you want to continue?

1. Formalizing DFSAs (20 pts.) Let LAP (n, m), n ≥ 0, m > 0 be the language of strings over Σ = {a} whose lengths are in an arithmetic progression. Formally, LAP (n, m) = {an+km | k ≥ 0}. Give a formal (mathematical) description of a DFSA for LAP (n, m) (that is, give the 5-tuple M = (Q, Σ, δ, q0 , F )). Solution. Consider the following 5-tuple, M = (Q, Σ, δ, q0 , F ) with Σ = {a}. We will have a total of n + m states in the DFSA with the ﬁrst n states being used to count oﬀ an and the last m states is a loop. Q = {q0 , q1 , . . . , qn+m−1 } F = {qn } δ(qi , a) = qi+1 , if i = n + m − 1 qn , if i = n + m − 1

2. Nondeterministic Finite State Machines (20 pts.) Give a NFSA (by transition diagram) for each of the following languages. Also brieﬂy explain how your machine works. You may not use ε-moves. No credit for DFSAs. Verify you answer by performing a sanity check. Assume Σ = {a,b}. (a) L1 = the set of all strings over {a,b} such that the string ends with a b followed by 2 or more a’s. For example, abaabbaaaa ∈ L1 , but abaabba ∈ L1 , aaaaa ∈ L1 . Solution. The following NFSA accepts L1 . a,b a start q0 b q1 a q2 a q3

(b) L2 = the set of all strings over {a,b} such that the string has atleast 4 characters and the string starts and ends with the same two letters. For example, abab,aabaaa,bbbbb ∈ L2 but aaa,abaa,baab ∈ L2 . Solution. The following NFSA accepts L2 . Edges analogous to the one from q4 are to be added to q3 , q5 and q6 .

1

bb respectively and “remember” it. q3 } b (d) All NFSA (30 pts. it accepts w only if there exist 5 diﬀerent computation paths for w from the start state to each one of the accepting states.b q5 b a b q4 a q7 b q8 a a a. Solution. a a b a b a start {q0 } {q0 . q1 } {q0 . q5 .b start q0 b q2 a b q6 b b a. (c) Rabin-Scott algorithm (30 pts.ba.ab.b q3 a q1 a a. You may skip any dead or inaccessible states to simplify your answer.b The states all have meanings. The new DFSA obtained by converting the NFSA for L1 is. Show the entire process including the transition table and provide a transition diagram. 2 .) We deﬁne an All NFSA to be a NFSA which has no -moves and it accepts a word w if there exist (diﬀerent) computation paths for w that end in each one of its accepting states.) Convert your NFSA from part 2(a) for language L1 into a DFSA using the Rabin-Scott algorithm. q2 } {q0 . q6 each represent that the input string has been aa.a. for instance q3 . q4 . Thus if an all NFSA has 5 accepting states.

Solution. ii. i. Speciﬁcally highlight the diﬀerences between the above conversion and one that involves converting a standard NFSA to a DFSA.i. We note that the Robin Scott algorithm is exactly applicable for All NFSAs too with one minor modiﬁcation. ii. then it accepts the same language as when viewed as a standard NFSA. Given an all NFSA N . Then by applying the process of -elimination. Thus we will convert our DFSA (which may have many ﬁnal states) into a NFSA which has only one ﬁnal state. This will be the only modiﬁcation that will be necessary. Note that the new ﬁnal state that you create will also be an initial state IFF the original DFSA had its initial state as an accept state. The set of ﬁnal states in the new DFSA will be any set S which is contains the set of all ﬁnal states of the original all NFSA. construct a DFSA which accepts the same language using the Rabin-Scott algorithm. This can be done by adding a new ﬁnal state and adding -moves to this new state from the old ﬁnal states. we obtain a new NFSA with only one accept state and no -moves which gives us the needed all NFSA. Observe that if an All NFSA has only one ﬁnal state. 3 . Show that for every DFSA M there exists an all NFSA N that accepts the same language.

- 2001a2sol
- A R S D I G I T A
- N301. M2. NumberSystems
- Fundamentals of Mathematics for Computer Science
- Books for All Subject
- Compiler- 04
- MELJUN CORTES Automata Lecture Turing Machines 1
- Lexical Analyzer
- regex
- 07 Chapter 07
- NFA to DFA
- Paper 6-A Project Based CSIS-1 Course With an Active Learning Environment
- Course Descriptions
- Cntrl Experiment 3(Haari)
- m1
- Web Programming Exam Cheat Sheet
- Lists
- Bh 23349353
- The Greatest Integer Function
- 10 Resources free of charge Computer system Shows
- Scheduling Algorithm
- How to Prepare for an Interview With Google – Everything You Need to Know. _ by Alexander Rojas
- Ax2009 Enus Deviii Toc
- Top Schools in Ghaziabad
- cv
- CV Jean Francois Laloux
- Chapter1_intro to Programming
- download_cs111_01 Introduction to Computers
- Norvig Style
- Least Square Deconvolution

- SCT 2011
- UT Dallas Syllabus for mis6323.001.09s taught by Jayatirtha Asundi (jxa027000)
- UT Dallas Syllabus for cs4v95.001.09f taught by Xiaohu Guo (xxg061000)
- The Tower Undergraduate Research Journal Volume II
- GEARS January-February 2016
- UT Dallas Syllabus for se4376.001.08s taught by Yuke Wang (yuke)
- UT Dallas Syllabus for cs3v95.001 05s taught by Greg Ozbirn (ozbirn)
- System Analysis and Design MCQ'S
- UT Dallas Syllabus for cs1336.001 05s taught by Martha Sanchez (mxs015000)
- UT Dallas Syllabus for cs4337.001.09f taught by Shyam Karrah (skarrah)
- UT Dallas Syllabus for ba4318.0u1.09u taught by Abhijeet Ghoshal (axg053200)
- UT Dallas Syllabus for se3376.5e3.11s taught by Mark Nelson (mrn017000)
- UT Dallas Syllabus for se3376.002.10f taught by Jeyakesavan Veerasamy (veerasam)
- Object Oriented Programming 2011
- UT Dallas Syllabus for cs4337.001.10f taught by Shyam Karrah (skarrah)
- UT Dallas Syllabus for cs4337.501 06s taught by Shyam Karrah (skarrah)
- UT Dallas Syllabus for cs5375.502 05s taught by Rafael Lacambra (rml021000)
- UT Dallas Syllabus for cs1336.501.11f taught by Feliks Kluzniak (fxk083000)
- UT Dallas Syllabus for cs1336.002 06s taught by Laurie Thompson (lthomp)
- Implementation OF irrigation Process using embedded PLC
- School of Computer Technology - Sunway University College 2011
- UT Dallas Syllabus for cs4337.021 06u taught by Shyam Karrah (skarrah)
- UT Dallas Syllabus for cs4337.001 06s taught by Shyam Karrah (skarrah)
- UT Dallas Syllabus for cs1136.002 06s taught by George Steinhorst (csteinh)
- UT Dallas Syllabus for cs1136.002 05f taught by George Steinhorst (csteinh)
- UT Dallas Syllabus for cs1336.003 06s taught by Shyam Karrah (skarrah)
- UT Dallas Syllabus for cs1337.003.07s taught by Timothy Farage (tfarage)
- UT Dallas Syllabus for mis6323.501 05f taught by Jayatirtha Asundi (jxa027000)
- UT Dallas Syllabus for cs3375.001 05s taught by Rafael Lacambra (rml021000)
- UT Dallas Syllabus for cs1136.001 06s taught by George Steinhorst (csteinh)

Sign up to vote on this title

UsefulNot usefulClose Dialog## Are you sure?

This action might not be possible to undo. Are you sure you want to continue?

Close Dialog## This title now requires a credit

Use one of your book credits to continue reading from where you left off, or restart the preview.

Loading