Elfakhakhre, Nawara R.F. (2010) Finite Automata And Applications. Masters thesis, Universiti Sains Malaysia.
![[img]](http://eprints.usm.my/style/images/fileicons/application_pdf.png)
|
PDF
Download (683kB) | Preview |
Abstract
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.
| Item Type: | Thesis (Masters) |
|---|---|
| Subjects: | Q Science > QA Mathematics > QA1 Mathematics (General) |
| Divisions: | Pusat Pengajian Sains Matematik (School of Mathematical Sciences) |
| Depositing User: | Administrator Automasi |
| Date Deposited: | 02 Jun 2015 02:42 |
| Last Modified: | 02 Jun 2015 06:31 |
| URI: | http://eprints.usm.my/id/eprint/28888 |
Actions (login required)
 |
View Item |
