Open AccessAUTOMATA SEBAGAI MODEL PENGENAL BAHASA
Author(s) -
Eddy Maryanto
Publication year - 2009
Publication title -
jurnal ilmiah matematika dan pendidikan matematika (jmp)/jurnal ilmiah matematika dan pendidikan matematika
Language(s) - English
Resource type - Journals
eISSN - 2550-0422
pISSN - 2085-1456
DOI - 10.20884/1.jmp.2009.1.2.2981
Subject(s) - computer science , nondeterministic finite automaton , deterministic automaton , deterministic finite automaton , two way deterministic finite automaton , programming language , compiler , finite state machine , nondeterministic algorithm , pushdown automaton , büchi automaton , automaton , theoretical computer science , automata theory
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.