AUTOMATA SEBAGAI MODEL PENGENAL BAHASA
Abstract
A deterministic finite automaton as well a nondeterministic finite automaton can be used to model a language recognizer. In computer software technology, language recognizer usually be an integrated part of a compiler, that is a computer program that take responsibility to translate source code into machine code. Comparing with a deterministic finite automaton, a nondeterministic finite automaton is a better model for language recognizer because it might be simpler and less in size than a deterministic one.
Published
2009-10-30
How to Cite
MARYANTO, Eddy.
AUTOMATA SEBAGAI MODEL PENGENAL BAHASA.
Jurnal Ilmiah Matematika dan Pendidikan Matematika, [S.l.], v. 1, n. 2, p. 53-58, oct. 2009.
ISSN 2550-0422.
Available at: <http://jos.unsoed.ac.id/index.php/jmp/article/view/2981>. Date accessed: 19 apr. 2024.
doi: https://doi.org/10.20884/1.jmp.2009.1.2.2981.
Section
Articles