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.
Highlights
Teori komputasi merupakan studi matematis proses kerja mesin komputer
language recognizer usually be an integrated part of a compiler
a nondeterministic finite automaton is a better model for language recognizer
Summary
Teori komputasi merupakan studi matematis proses kerja mesin komputer. Komputer merupakan mesin elektronik yang memproses data berdasarkan instruksi yang diberikan yang mana instruksi ini ditulis dengan menggunakan bahasa pemrograman tertentu. Karena bahasa merupakan himpunan maka kita dapat menyatakan bahasa yang terhingga dengan membuat daftar string dari bahasa tersebut.
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Jurnal Ilmiah Matematika dan Pendidikan Matematika
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
