Finite Automata And Applications
A finite automaton can be considered as the simplest machine model in that the machine has a finite memory. Automaton terhingga (finite automaton) boleh dianggap sebagai suatu model mesin teringkas, yang mempunyai memori terhingga.
| Main Author: | |
|---|---|
| Format: | Thesis |
| Language: | English |
| Published: |
2010
|
| Subjects: | |
| Online Access: | http://eprints.usm.my/28888/ http://eprints.usm.my/28888/1/FINITE_AUTOMATA_AND_APPLICATIONS.pdf |