| ![]() |
Common today in Computer Information Systems (CIS) education programs are two types of analysis for software development, top-down and object-oriented. Often overlooked is state transition analysis. In an effort to introduce students to the concept of deterministic finite automata, an advance programming in COBOL course completed a final project of building a DFA tool in COBOL.
Keywords: deterministic finite automata, finite automata, DFA, FA, finite state machine, FSM
Read this presentation handout (non-refereed) in Adobe Portable Document (PDF) format. (5 pages, 356 K bytes)
Preview this presentation handout (non-refereed) in Plain Text (TXT) format. (11 K bytes)
View the PowerPoint Slides (PPT) for this presentation. (200 K bytes)

Comments and corrections to
webmaster@isedj.org