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.
Saved in:
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 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
S-Permutability, Semipermutability, c-Normality And
c-Permutability Of Subgroups In Finite Groups
by: Al-Sharo, Doa'a Mustafa
Published: (2014) -
Modelling of n-TH order limit language using automata theory in DNA splicing system
by: Siti Hajar, Mohd Khairuddin
Published: (2022) -
A Study Of Several Explicit Finite Difference Schemes For The
Linear Convection Equation
by: Abdullah, Norul Huda
Published: (2007) -
Finite Difference Methods For Linear Fuzzy Time Fractional Diffusion And Advection-Diffusion Equation
by: Zureigat, Hamzeh Husni Rasheed
Published: (2019) -
Learning automata-based solution to target coverage problem for directional sensor networks with adjustable sensing ranges
by: Razali, Mohd. Norsyarizad
Published: (2017)