Papers by ANESSA AGNES HIDRIYA
We investigate several unconventional models of finite automata and algorithms. We show that two-... more We investigate several unconventional models of finite automata and algorithms. We show that two-way alternating automata can be smaller than fast bounded-error probabilistic automata. We introduce ultrametric finite automata which use p-adic numbers to describe the branching process of the computation. We examine the size complexity of all the abovementioned automata for the counting problem. We also examine two-way frequency finite automata. We define ultrametric query algorithms and examine ultrametric query complexity for Boolean functions. We generalize the notion of frequency computation by requiring some structure for the correct outputs.
When we do everything with love, so that everything will become lovely Everything will be oka... more When we do everything with love, so that everything will become lovely Everything will be okay in the end, if it is not okay it is not the end Do not be afraid of changes, embrace the changes because the world changes all the time No days without smile Dedication: This skripsi is dedicated to: Her beloved family who always gives support and huge love Her beloved husband who always gives the eternal love and affection, pray and support to encourage her in finishing this skripsi Her colleagues in PNPM Mandiri Perkotaan Kudus who always gives her motivation, support and care everything of her Her dearest best friends "Skynet" Everyone who knows and cares her v ADVISORS' APPROVAL This is to certify that the Sarjana Skripsi of Anessa Agnes Hidriya has been approved by the advisors for further approval by the Examining Committee.
Uploads
Papers by ANESSA AGNES HIDRIYA