From A-State Computer Science Wiki
|This page is undergoing initial construction or a major update. Please be advised that material that appears here may not be correct or current, and may change before the page is finalized.|
CS 4-5723 Automata Theory
Fall 2011, Section 001, TR 9:30am-10:45am, CSM 211 (3 credits)
|Dr. Jeff Jenness|
|Office||CSM 132||Office Hours||TR 11:00am-12:00pm and MW 11:00pm-12:00pm|
|Phone||870-972-3978 ext. email@example.com|
- CS 4-5723. Automata Theory
- Study formal languages and equivalent models of computation, finite state automata and regular expressions, push down automata and context free grammars, pumping lemmas and closure properties, and turing machines. Prerequisites: CS 3113. Fall odd.
(subject to change)
Dates to Remember
Programming in the Infinite, 1st ed. (ISBN: 999-0000000000), by E. Ternal. Unbounded Publishing, 2010. (Amazon)
- Go here for course supplements.
See also: Department Policies
- Infinity en.wikipedia.org/wiki/Infinity Wikipedia article about infinity