Every automaton can be decomposed into a cascade of basic prime automata. This is the Prime Decomposition Theorem by Krohn and Rhodes. Guided this theory, we propose automata cascades as structured, modular, way to describe complex systems made many components, each implementing specific functionality. Any serve component; using components allows for fine-grained control expressivity resulting ...

Optimizing the database queries is one of hard research problems. Exhaustive search techniques like dynamic programming is suitable for queries with a few relations, but by increasing the number of relations in query, much use of memory and processing is needed, and the use of these methods is not suitable, so we have to use random and evolutionary methods. The use of evolutionary methods, beca...

Feature selection is of great importance in Quantitative Structure-Activity Relationship (QSAR) analysis. This problem has been solved using some meta-heuristic algorithms such as: GA, PSO, ACO, SA and so on. In this work two novel hybrid meta-heuristic algorithms i.e. Sequential GA and LA (SGALA) and Mixed GA and LA (MGALA), which are based on Genetic algorithm and learning automata for QSAR f...

The main goal of the present study was to implement a hybrid pattern of cellular automata model and particle swarm optimization algorithm based on TM and ETM+ imagery of landsat satellite from 1988 to 2010 for simulating the urban sprawling. In this study, an alternative model was implemented in two ways: the first method was based on two images (1988 and 2010) and the second one was based on t...

We present pumping lemmas for five classes of functions definable by fragments weighted automata over the min-plus semiring, max-plus semiring and natural numbers. As a corollary we show that hierarchy unambiguous, finitely-ambiguous, polynomially-ambiguous automata, full class is strict semirings.

Abstract Spot is a C++17 library for LTL and $$\omega $$ ? -automata manipulation, with command-line utilities, Python bindings. This paper summarizes its evolution over the past six years, since release of 2.0, which was first version to support arbitrary acceptance conditions, last presented at conference. ...

We are motivated by the following question: which data languages admit an active learning algorithm? This question was left open in previous work authors, and is particularly challenging for recognised nondeterministic automata. To answer it, we develop theory of residual nominal automata, a subclass prove that this class has canonical representatives, can always be constructed via finite numbe...

In this paper, we give a Nivat-like characterization for weighted alternating automata over commutative semirings (WAFA). To purpose prove that can be characterized as the concatenation of finite tree (WFTA) and specific class homomorphism. We show series recognized by is closed under inverses homomorphisms, but not homomorphisms. logical automata, which uses MSO logic trees. Finally investigat...