This paper presents a contribution to minimization of intuitionistic fuzzy automata. In this paper the concept of substitution property (SP) partition for a finite intuitionistic fuzzy automaton is formulated, and the quotient automaton with respect to an SP partition is defined.

We address the problem of building an index for a set D of n strings, where each string location is a subset of some finite integer alphabet of size σ, so that we can answer efficiently if a given simple query string (where each string location is a single symbol) p occurs in the set. That is, we need to efficiently find a string d ∈ D such that p[i] ∈ d[i] for every i. We show how to build suc...

The origin and evolution Magicicada spp. life cycle is one of the most intriguing problems in evolutionary biology. These long term periodical life cycles with prime period (namely 13 and 17 years) and the incredibly synchronized emergence of the adults have defied all attempts of ultimate explanation. During the last 15 years a plethora of models and possible explanations for this phenomenon a...

Let S be a string of length n with characters from an alphabet of size σ. The subsequence automaton of S (often called the directed acyclic subsequence graph) is the minimal deterministic finite automaton accepting all subsequences of S. A straightforward construction shows that the size (number of states and transitions) of the subsequence automaton is O(nσ) and that this bound is asymptotical...

We present a method to store additional information in a minimal automaton so that it is possible to compute a corresponding tree node number for a state. The number can then be used to retrieve additional information. The method works for minimal (and any other) deterministic acyclic finite state automata (DFAs). We also show how to compute the inverse mapping.

Analysis by reduction is a method used in linguistics for checking the correctness of sentences of natural languages. This method is modelled by restarting automata. Here we introduce and study a new type of restarting automaton, the socalled t-sRL-automaton, which is an RL-automaton that is rather restricted in that it has a window of size 1 only, and that it works under a minimal acceptance c...

The chapter considers the method of probabilistic control of mobile robots navigating in random environments and mimicking the foraging activity of ants, which is widely accepted as optimal with respect to the environmental conditions. The control is based on the Tsetlin automaton, which is a minimal automaton demonstrating an expedient behavior in random environments. The suggested automaton i...

We show that every regular language defines a unique nondeterministic finite automaton (NFA), which we call “átomaton”, whose states are the “atoms” of the language, that is, non-empty intersections of complemented or uncomplemented left quotients of the language. We describe methods of constructing the átomaton, and prove that it is isomorphic to the normal automaton of Sengoku, and to an auto...

Abst rac t . We adapt a generic minimal model generation algorithm to compute the coarsest finite model of the underlying infinite transition system of a timed automaton. This model is minimal modulo a timeabstracting bisimulation. Our algorithm uses 9 refinement method that avoids set complementation, and is considerably more efficient than previous ones. We use the constructed minimal model f...

We provide a Myhill-Nerode-like theorem that characterizes the class of data languages recognized by deterministic finite-memory automata (DMA). As a byproduct of this characterization result, we obtain a canonical representation for any DMA-recognizable language. We then show that this canonical automaton is minimal in a strong sense: it has the minimal number of control states and also the mi...