Title:  How the DFA (deterministic finite automaton) is not 
Speaker:  Thomas F. Piatkowski Professor of Computer Science and Electrical and Computer Engineering Department of Computer Science Western Michigan University Kalamazoo, Michigan 
Abstract:  Automata theory is one of the most mathematical areas of computerscience. Two of the important uses of automata are:

Location:  Palenske 227 
Date:  11/8/2007 
Time:  3:10 PM 
@abstract{MCS:Colloquium:ThomasFPiatkowski
ProfessorofComputerScienceandElectricalandComputerEngineering
DepartmentofComputerScience
WesternMichiganUniversity
KalamazooMichigan:2007:11:8, author = "{Thomas F. Piatkowski
Professor of Computer Science and Electrical and Computer Engineering
Department of Computer Science
Western Michigan University
Kalamazoo, Michigan}", title = "{How the DFA (deterministic finite automaton) is not}", address = "{Albion College Mathematics and Computer Science Colloquium}", month = "{8 November}", year = "{2007}" }