We introduce a subclass of non deterministic finite automata (NFA) that we call Residual Finite State Automata (RFSA): a RFSA is a NFA all the states of which define residual languages of the language it recognizes. We prove that for every regular language L, there exists a unique RFSA that recognizes L and which has both a minimal number of states and a maximal number of transitions. Moreover,...

Multirobot systems (MRSs) are capable of solving task complexity, increasing performance in terms of maximizing spatial/ temporal/radio coverage or minimizing mission completion time. They are also more reliable than single-robot systems as robustness is increased through redundancy. Many applications such as rescue, reconnaissance, and surveillance and communication relaying require the MRS to...

We review a family of closely related query learning algorithms for unweighted and weighted tree automata, all of which are based on adaptations of the minimal adequate teacher (MAT) model by Angluin. Rather than presenting new results, the goal is to discuss these algorithms in sufficient detail to make their similarities and differences transparent to the reader interested in grammatical infe...

We give a new presentation of two results concerning synchronized automata. The first one gives a linear bound on the synchronization delay of complete local automata. The second one gives a cubic bound for the minimal length of a synchronizing pair in a complete synchronized unambiguous automaton. The proofs are based on results on unambiguous monoids of relations. Mathematics Subject Classifi...

We address the problem of allocating a minimal number of clocks to timed automata. To make the problem tractable we assume that all locations are reachable. We identify a fairly general class of timed automata, TADS , for which there is an algorithm whose complexity is quadratic in the size of the graph.

Recently, a characterization of the class of nondeterministic finite automata (NFAs) for which determinization results in a minimal deterministic finite automaton (DFA), was given in [2]. We present a similar result for the case of symmetric difference NFAs. Also, we show that determinization of any minimal symmetric difference NFA produces a minimal DFA.

We introduce STORMED hybrid systems, a decidable class of hybrid systems which is similar to o-minimal hybrid automata in that the continuous dynamics and constraints are described in an o-minimal theory. However, unlike o-minimal hybrid automata, the variables are not initialized in a memoryless fashion at discrete steps. STORMED hybrid systems require flows which are monotonic with respect to...

This chapter is concerned with the design and analysis of algorithms for minimizingfinite automata. Getting a minimal automaton is a fundamental issue in the use and implementationof finite automata tools in frameworks like text processing, image analysis, linguistic computerscience, and many other applications.Although minimization algorithms are rather old, there were recently...

It is shown that cellular automata can be used for feature extraction of images in image pattern matching systems. The problem under consideration is an image pattern matching problem of a single image against a database of LEGO bricks. The use of cellular automata is illustrated, and solves this classical content-based image retrieval problem in near realtime, with minimal memory usage.

We present a categorical framework to study probabilistic automata starting by obtaining aggregation and interconnection as universal constructions. We also introduce the notion of probabilistic behavior in order to get adjunctions between probabilistic behavior and probabilistic automata. Thus we are able to extend to the probabilistic setting free and minimal realizations as universal constru...