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: | Elfakhakhre, Nawara R.F. |
---|---|
Format: | Thesis |
Language: | English |
Published: |
2010
|
Subjects: | |
Online Access: | http://eprints.usm.my/28888/1/FINITE_AUTOMATA_AND_APPLICATIONS.pdf |
Similar Items
-
Directed graph in finite automata over finite groups
by: Fong, Wan Heng, et al.
Published: (2015) -
Automata diagram for finite groups
by: Fong, Wan Heng, et al.
Published: (2013) -
Automata for subgroups
by: Fong, Wan Heng, et al.
Published: (2014) -
Modeling Of Groundwater By Using Finite Difference Methods And Simulation.
by: Baharum, Adam, et al.
Published: (2009) -
MSG485 - Finite Element Methods June 2018
by: PPSM, Pusat Pengajian Sains Matematik
Published: (2018)