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.

Bibliographic Details

Main Author:	Elfakhakhre, Nawara R.F.
Format:	Thesis
Language:	en
Published:	2010
Subjects:	QA1 Mathematics (General)
Online Access:	http://eprints.usm.my/28888/1/FINITE_AUTOMATA_AND_APPLICATIONS.pdf http://eprints.usm.my/28888/
Tags:	Add Tag No Tags, Be the first to tag this record!