Claim Missing Document
Check
Articles

Found 3 Documents
Search

Perancangan dan Implementasi Query Data Extractor Berbasis Remote Method-Invocation Eddy Maryanto; Teguh Cahyono; Nur Chasanah
Jurnal Nasional Teknik Elektro dan Teknologi Informasi Vol 8 No 1: Februari 2019
Publisher : Departemen Teknik Elektro dan Teknologi Informasi, Fakultas Teknik, Universitas Gadjah Mada

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (1012.111 KB)

Abstract

Distributed databases have been a research subject that attracted many researchers to study. Distributed databases have many advantages, such as reliability and data availability. There are still many problems in this subject area that need to be solved through researches. In this paper, query data extractor, a subsystem of distributed database system, is designed and implemented. Query data extractor reside at the heart of the distributed database system. The main task of the query data extractor is to extract query data issued by applications sitting at a site to result data needed by optimizer subsystem in fragmentation and allocation processes.
AUTOMATA SEBAGAI MODEL PENGENAL BAHASA Eddy Maryanto
Jurnal Ilmiah Matematika dan Pendidikan Matematika Vol 1 No 2 (2009): Jurnal Ilmiah Matematika dan Pendidikan Matematika
Publisher : Jurusan Matematika FMIPA Universitas Jenderal Soedirman

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.20884/1.jmp.2009.1.2.2981

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.
AUTOMATA SEBAGAI MODEL PENGENAL BAHASA Eddy Maryanto
Jurnal Ilmiah Matematika dan Pendidikan Matematika (JMP) Vol 1 No 2 (2009): Jurnal Ilmiah Matematika dan Pendidikan Matematika (JMP)
Publisher : Universitas Jenderal Soedirman

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.20884/1.jmp.2009.1.2.2981

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.