Jurnal Ilmiah Matematika dan Pendidikan Matematika (JMP)
Vol 1 No 2 (2009): Jurnal Ilmiah Matematika dan Pendidikan Matematika

AUTOMATA SEBAGAI MODEL PENGENAL BAHASA

Eddy Maryanto (Universitas Jenderal Soedirman)

Article Info

Publish Date
30 Oct 2009

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.

Copyrights © 2009




Citation Download
RIS
EndNote, Reference Manager, ProCite
BibTex
Latex, Jabref
Original Source
Download Original
Google Scholar
Check in Google Scholar
Journal Info
Jurnal Ilmiah Matematika dan Pendidikan Matematika (JMP)
Website

Abbrev

jmp

Publisher

Universitas Jenderal Soedirman

Subject

Mathematics

Description

JMP is a an open access journal which publishes research articles, reviews, case studies, guest edited thematic issues and short communications/letters in all areas of mathematics, applied mathematics, applied commutative algebra and algebraic geometry, mathematical biology, physics and engineering, ...