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 ...

In this paper, we establish the learnability of simple deterministic finitememory automata via membership and equivalence queries. Sim ple deterministic fmitememory automata are a subclass of finitememory automata introduced by Kaminski and Francez (1994) as a model gen eralizing finite automata to infinite alphabets. Continuously, Sakamoto and Ikeda investigated several decision problems for f...

Merging states in finite automata is a main method of reducing the size of the representation of regular languages. The process has been extensively studied for deterministic finite automata, where the conditions for merging states can be efficiently computed. The matter is more complex in the case of non-deterministic finite automata, where merging states can be done in different ways, and the...

Deterministic finite automata are one of the simplest and most practical models computation studied in theory. Their conceptual extension is non-deterministic which also have plenty applications. In this article, we study these through lens succinct data structures where our ultimate goal to encode mathematical objects using information-theoretically optimal number bits along with supporting qu...

Deterministic finite automata are one of the simplest and most practical models computation studied in theory. Their extension is non-deterministic which also have plenty applications. In this article, we study these through lens succinct data structures where our ultimate goal to encode mathematical objects using information theoretically optimal number bits along with supporting queries on th...

We analyze the minimization problem for deterministic weak automata, a subclass of deterministic Büchi automata, which recognize the regular languages that are recognizable by deterministic Büchi and deterministic co-Büchi automata. We reduce the problem to the minimization of finite automata on finite words and obtain an algorithm running in time O(n · logn), where n is the number of states of...

We approach the task of computing a carefully synchronizing word minimum length for given partial deterministic automaton, encoding problem as an instance SAT and invoking solver. Our experiments demonstrate that this gives satisfactory results automata with up to 100 states even if very modest computational resources are used. compare our ones obtained by first author exact synchronization, wh...