Discrete mathematics with computer science applications
Discrete mathematics with computer science applications
Introduction to computer theory
Introduction to computer theory
Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
Learning to program = learning to construct mechanisms and explanations
Communications of the ACM
A mathematically focused curriculum for computer science
Communications of the ACM
Coping with deeply nested control structures
ACM SIGPLAN Notices
Discrete Mathematics: A Unified Approach
Discrete Mathematics: A Unified Approach
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
| Hi-index | 0.00 |
In the computer science curriculum, finite state machines and finite automata are typically introduced at the upper-division level. However, students can benefit from an earlier, informal exposure to finite automata for three reasons:- Finite automata represent a useful application when two-dimensional arrays are introduced.- A painless early introduction can ease the transition to rigorous approaches encountered later.- Finite automata provide yet another algorithmic tool to be added to the student's repertoire.