EECS 2001 Lecture Notes - Lecture 3: Jab, Init, The M Machine

99 views10 pages

burgundypig932

15 Dec 2019

School

York University

Department

Electrical Engineering and Computer Science

Course

EECS 2001

Professor

Enas Altarawneh

For unlimited access to Class Notes, a Class+ subscription is required.

Document Summary

Models designed for computers with extremely limited memory can do onlyspegific. L elevator doors task ii a o n of. Takesinputonebyone fromtheinputstring acceptstate021 oproduces output: output isaccept if mi is in acceptstate outputis rejectif 19 is in rejectstate outputis eitheraccepttraject. 1 144 start state q is the q2. A ra accepts the set of stringsa state diagram of mine 112 i. Hence it"s language would be w i w ends in at. L hz w i w is an emptystring or ends with 0. Li setof all strings that start with 0. O oo o l ooo o t o o 11 0000 n. Designing the machine setof all strings thatthis machineaccepts. D after receiving firstinputif b receives either 0 i ith input it"s an acceptstate selfloops as. If it receives 1 transition happensfromatostate cwhich takesintheinput 1 only ibfheaniffnsisaeiythefatqa. at it selfloopsin e anddoesnot. A construct a dea thatacceptssetsof all strings over set of input alphabets.

Related Questions

9. Finally, you should write a program MontrealMaps which will suggest a path to go along the metro to get from one place to another. The only required method for MontrealMaps is a main method but of course you are allowed to write others. Your program should do the following. For any library methods that you use, make sure that you are properly importing things and handling any exceptions they may throw. (10 points) • Using an appropriate library method, you should create a Subway System object. If this method fails to initialize, you should print the message Error, not enough funding. • Use a Scanner and print statements to read the current x and y position of the user. • Use a Scanner and print statements to read the x and y position that the user wants to go to. . Find the nearest Metro Station to both the start position of the user and his final destination. • If the 2 metro stations have the same name (i.e. are the same metro station) then print It is fastest to walk there. • Otherwise, call the method findPath from the previous part to find a path from these 2 metro stations. . If the method returns null, then print Sorry, there is no path on the metro, you'll have to walk • Otherwise, print the path using the metro using the method printPath defined in the MapUtilities class in the appendix. SUMMARY OF JAVA STANDARD LIBRARY METHODS POR SELECTED CLASSES • String package java.lang) Methods - public boolean gist and e rs is stingeancoject - puble boolean grease Sering another ca t ering String paint i th Stre C h eshilly before the Stripe with striert w Single weiter water N ENE fusha -publish tohy Casting de . File( p age java.io) Methods r eate - publie Yiling path : C • Scanner (package java.ut 1) Method -ple S ule - double Double Sc - le bon when : S Scanner tal de fethede h able othebean - puble String Best Mus eethe u s tepal -pulle haalean haxtLine: Check the hea ther in left PrintStream( p age java.io) Methods pul vaid pri Pribonaat - puli wid pride d oble vile. - pille vaid print Print vei. -pulle vaid printject o: Prints Object -puli vaid printString : Prints String .. - vaid primi The theme line by writing the li n e tie id print in bool bl. Prise n value the - public void platinabled Prints double ved and then the line - public void printit Prints Ent value and then tomis the - Pull vaid pri l l be t he minime publie wild prin t ing with String in the terminates the line • ArrayLiat package java.util) Methods - public boolean Arraybettype was a new ArrayList

EECS 2001 Lecture Notes - Lecture 3: Jab, Init, The M Machine

Document Summary

Get access

Related Documents

EECS 2001 Final: EECS2001 Final Exam 2009

EECS 2001 Final: EECS2001 2012 Final Exam

CS 4510 Lecture Notes - Lecture 1: Finite-State Machine

Related Questions