In this paper we study the problem of minimising deterministic automata over finite and infinite words. Deterministic finite automata are the simplest devices to recognise regular languages, and deterministic Büchi, Co-Büchi, and parity automata play a similar role in the recognition of ω-regular languages. While it is well known that the minimisation of deterministic finite and weak automata i...

Bob Frank, Giorgio Satta, and Lauri Karttunen stunned the computational OT community some years ago when they pointed out that unidirectional optimization is essentially a finite state technique. If all components of an OT system can be modeled by a finite state machine, then the complexity of the entire system does not exceed the complexity of its components. There has been some debate in past...

Salah satu masalah kesehatan dunia disebabkan oleh rokok. Menurut Organisasi Kesehatan Dunia (WHO), ada 2,5 miliar perokok di dunia, dua pertiganya negara berkembang. Pandemi Covid 19 menyebabkan penurunan daya beli masyarakat karena sebagian besar mengurangi aktivitas luar ruangan untuk menekan penyebaran 19. Strategi yang dapat dilakukan memasarkan cangklong rokok yaitu dengan memanfaatkan Ve...

In this report we study the problem of minimising deterministic automata over finite and infinite words. Deterministic finite automata are the simplest devices to recognise regular languages, and deterministic Büchi, Co-Büchi, and parity automata play a similar role in the recognition of ω-regular languages. While it is well known that the minimisation of deterministic finite and weak automata ...

-The paper presents a novel approach for runtime reliability estimation of executable software during software execution. The proposed model does not depend on post failure data analysis whose accuracy depends on assumptions about some dubious statistical distribution. Instead the model captures required estimates during runtime from state to state transition. Thus, the model computes software ...