Slicing is a technique, traditionally applied to programs, for extracting the parts of a program
that affect the values computed at a statement of interest. In recent years authors have …

Bisimulations have been widely used in many areas of computer science to model
equivalence between various systems, and to reduce the number of states of these systems …

We present a new aperiodic tileset containing 11 Wang tiles on 4 colors, and we show that
this tileset is minimal, in the sense that no Wang set with either fewer than 11 tiles or fewer …

Automatic sequences are sequences over a finite alphabet generated by a finite-state
machine. This book presents a novel viewpoint on automatic sequences, and more …

Weakly linear systems of fuzzy relation inequalities and equations have recently emerged
from research in the theory of fuzzy automata. From the general aspect of the theory of fuzzy …

We show that the state reduction problem for fuzzy automata is related to the problem of
finding a solution to a particular system of fuzzy relation equations in the set of all fuzzy …

In this paper we study systems of fuzzy relation inequalities and equations of the form U∘
Vi≤ Vi∘ U (i∈ I), where U is an unknown and Vi (i∈ I) are given fuzzy relations, the dual …

In our recent paper we have established close relationships between state reduction of a
fuzzy automaton and resolution of a particular system of fuzzy relation equations. In that …

We give faster algorithms for two methods of reducing the number of states in
nondeterministic finite automata. The first uses equivalences and the second uses …

This paper investigates the minimization problem of fuzzy automata, aiming to obtain a
procedure for finding a minimal state fuzzy automaton equivalent to a given one. The …