CS 4110 Concepts of Formal Languages and Algorithms for Computing Syllabus

Transcription

1 General Information Semester: Fall 2017 Textbooks: When: Required: Introduction to Computer Theory; 2 nd Edition, Cohen, Daniel I.A. Cohen; ISBN Tuesdays and Thursdays, 5:30pm to 7:20pm Location: SLCC Redwood Road, Business Building, Room BB 215 Instructor Info: Office Hours: Website: Ted Cowan tedcowan@weber.edu (801) Redwood) Mondays, Tuesdays and Redwood by appointment only, Technology Building, First Floor, Room 133. To schedule me when I am available at SLCC, access Objectives of This Course From the catalog: Concepts of formal language definition, automata theory, Turing theory, and solvability, with an introduction of algorithms and computational methods used in advanced computer science courses. Prerequisite: CS 2420 and either MATH 1630 or CS Upon successful completion of this course, students should be able to: Define the theory of formal languages Differentiate between an alphabet and a language Define terms such as length, Palindrome and Kleene closure Describe and implement proofs by constructive algorithm Form a recursive definition Create and identify a regular expression, a finite language, Finite Automata, Transition Graphs, non-deterministic Finite Automata, Mealy and Moore machines, a regular language Create and identify a non-regular language, a Pumping Lemma, decidability, a context-free grammar, Lukasiewicz Notation Create and identify Chomsky Normal Form, a pushdown stack, Create a pushdown automata for ever context free grammar Create a simple parser Create a simple Turing Machine

2 Students with Disabilities Students who have special needs or disabilities that may affect their ability to access information and/or material presented in this course are encouraged to access to register with the WSU SSD. Allotted Time You should anticipate spending two to three hours of study per week for each credit hour of a university course. Computer and programming classes typically require time in the upper range. Grading Your final grade will be determined from your performance in the following areas: Homework assignments 60% In-Class activities 10% Midterm 1 15% Midterm 2 15% Course Fees Course fees for the Computer Science major are designed to cover the costs of lab equipment maintenance and replacement including desktop and server computer systems and software; consumable materials and supplies; and support for lab aides, student tutors, and online instructional resources. Class Format I will be presenting the lecture material using PowerPoint slides, which will be available in Canvas. Attendance is mandatory for the lecture sessions. I will also allow time for lab work during class. Unless otherwise specified, you may study together as a group but you must complete and turn in your own assignments as an individual. Questions about the lab or reading material may be asked either in the classroom or in the Instructor s Blog in Canvas. Students are encouraged to reply to questions in the Instructor s Blog if they know the correct answer. Honesty CS Department policy dictates that any verifiable evidence of student academic cheating, as defined and determined by the instructor, will result in: 1) an automatic failing grade for the class and 2) a report to the Dean of Students that will include the student's name and a description of

3 the student's dishonest conduct. Cheating is defined in the Weber State University Policies and Procedures Manual located at Anyone determined to have copied another student's lab assignment, quiz or test will receive a failing grade for the semester. Please do your own work. The one exception are the in-class activities, which you are encouraged to complete together. You may study together but lab assignments, quizzes and tests are to be completed individually and not as a group. Please do not distribute or post solutions to lab assignments or the content of any quiz or test on the Internet. Homework Please complete the reading assignment prior to class. A schedule of reading and lab assignments can be found in Canvas. Lab time will be set aside so that lab work may be completed in class. Lab work may be completed at home if sufficient time is not available in class. Students are expected to be able to complete their software-centric assignments using a home computer accessible outside the classroom. Assignments Homework will be assigned during the semester with due dates as listed in Canvas. The homework assignments are referred to Lab Assignments and are designed to help you learn formal language concepts in a learn-by-doing manner. All assignment submissions will be uploaded to Canvas as specified in the assignment write-up. You may need a scanner to scan your diagrams for uploading to Canvas if you do not have access to a digital camera. I will subtract points for illegible student submissions. Your lowest homework score and your lowest two in-class activity scores will be dropped. Exams Two midterms will be administered during the semester in the classroom on the dates listed in Canvas. The midterms are based on the textbook and anything in the textbook chapters assigned may appear on an exam. An in-class preparation hour will be provided prior to each exam. The Midterms are closed book, closed note, closed Internet and closed neighbor. You will have the entire class period to complete each Midterm unless special arrangements are made in advance. Class Participation Class participation will be graded based on in-class activities, which cannot be completed in advance nor made up before or after the fact. Please be prepared for your instructor to create inclass activities on the fly as the needs of the class dictate, in the sole discretion of the instructor. It is possible that you may not receive an advance warning when an in-class activity will be conducted. I welcome relevant questions and discussion during class but I reserve the right to limit discussion in the interest of time. You must complete the reading assignment prior to class in order to participate in class discussion in any meaningful way.

4 Grading Scale The grading scale will be as follows: % = A % = B % = D % = A % = C % = D % = B % = C % = D % = B % = C- below 60% = E Miscellaneous Please place pagers, cell phones and PDAs on silent mode during class. If you must take an emergency call or page, quietly leave the classroom to conduct your conversation. We will be using computers in the classroom. Please ensure that all classroom computer activity is directly related to the lecture or assignment. The instructor reserves the right to amend the course schedule, study material, to add, change or subtract lab assignments, in-class activities, quizzes or examinations or to change the weight or percentage of the total grade of any assignment or assessment to best meet the needs of the class. Your instructor maintains office hours at his office at the SLCC Redwood Road campus on by appointment only, during the semester. See the Instructor Info section at the top of this syllabus for directions and instructions. We will not take a break during the class period. If you need to leave the classroom, please do so quietly without disturbing the class. If class is canceled due to weather or illness of the instructor, an will be sent to your Weber State address, a note will be place on the door of the room and an announcement will be published on Canvas. In the event of a prolonged campus closure, class assignments, lectures and information will be delivered online using Canvas. No extra credit will be offered for this class. I will not accept any late assignments this semester. If you do not mark your assignment as complete in Canvas, the due date has passed and I begin grading assignments, I will not attempt to grade yours and you will receive a zero for that assignment. A grade of Incomplete will be given only in extreme circumstances: 80% of the coursework must have been completed and the student must have an extenuating circumstance, such as a death in the immediate family or a severe illness.

5 Schedule Week Date Topics Assignments 1 Aug 28 Announcements and Introductions and Schedule Review Software Requirements Languages Chapters 1, 2 Homework 1 2 Sep 4 Recursive Definitions, Regular Expressions 3 Sep 11 Finite Automata, Transition Graphs 4 Sep 18 Kleene s Theorum 5 Sep 25 Finite Automata with Output, Regular Languages Chapter 3, 4 Homework 2 Chapters 5, 6 Homework 3 Chapter 7 Homework 4 Chapters 8, 9 Homework 5 6 Oct 2 Midterm Exam 1 7 Oct 9 Nonregular Languages, Decidability 8 Oct 16 Context-Free Grammars, Grammatical Format 9 Oct 23 Pushdown Automata, CFG=PDA Chapters 10, 11 Homework 6 Chapters 12, 13 Homework 7 Chapter 14, 15 Homework 8 10 Oct 30 Non-Context-Free Languages, Context-Free Languages Chapters 16, 17 Homework 9 11 Nov 6 Decidability Chapter 18 Homework Nov 13 Midterm Exam 2 13 Nov 20 Turing Machines Chapter 19 Homework Nov 27 JFlex Homework Dec 4 JFlex Homework 12