In the fault diagnosis of automaton, the vibration signal presents non-stationary and non-periodic, which make it difficult to extract the fault features. To solve this problem, an automaton fault diagnosis method based on morphological component analysis (MCA) and ensemble empirical mode decomposition (EEMD) was proposed. Based on the advantages of the morphological component analysis method i...

The simplest example of an infinite Burnside group arises in the class of automaton groups. However there is no known example of such a group generated by a reversible Mealy automaton. It has been proved that, for a connected automaton of size at most 3, or when the automaton is not bireversible, the generated group cannot be Burnside infinite. In this paper, we extend these results to automata...

The stochastic automaton is a simple and easy to handle type of model that has been used successfully in model-based process supervision and diagnosis. For large systems the automaton has a high complexity which can be reduced by structuring this model as an automaton network. For coupled systems the automaton network is directly obtained by compositional modelling. This paper starts with a rev...

Suffix automata and factor automata are efficient data structures for representing the full index of a set of strings. They are minimal deterministic automata representing the set of all suffixes or substrings of a set of strings. This paper presents a novel analysis of the size of the suffix automaton or factor automaton of a set of strings. It shows that the suffix automaton or factor automat...

We prove that if a group generated by a bireversible Mealy automaton contains an element of infinite order, its growth blows up and is necessarily exponential. As a direct consequence, no infinite virtually nilpotent group can be generated by a bireversible Mealy automaton. The study on how (semi)groups grow has been highlighted since Milnor’s question on the existence of groups of intermediate...

Recognizable graph languages are a generalization of regular (word) languages to graphs (as well as arbitrary categories). Recently automaton functors were proposed as acceptors of recognizable graph languages. They promise to be a useful tool for the verification of dynamic systems, for example for invariant checking. Since automaton functors may contain an infinite number of finite state sets...

Classical automata theory can not deal with uncertainty. To deal with uncertainty in system modeling, fuzzy automata come into the existence. Fuzzy automaton depends on membership value. For finding the membership degree of strings in fuzzy automata, the concept of max – min automaton and min – max automaton can be used. Many researchers have used the concept of max – min automaton for finding ...

Let L(M) be the (factorial) language avoiding a given anti-factorial language M. We design an automaton accepting L(M) and built from the language M. The construction is eeective if M is nite. If M is the set of minimal forbidden words of a single word v, the automaton turns out to be the factor automaton of v (the minimal automaton accepting the set of factors of v). We also give an algorithm ...

A cover automaton of a finite language L is a finite automaton that accepts all words in L and possibly other words that are longer than any word in L. An algorithm for constructing a minimal cover automaton of a finite language L is given in a recent paper. This paper goes a step further by proposing a procedure for constructing all minimal cover automata of a given finite language L. The conc...

The problem of computing the edit-distance between a string and a finite automaton arises in a variety of applications in computational biology, text processing, and speech recognition. This paper presents linear-space algorithms for computing the edit-distance between a string and an arbitrary weighted automaton over the tropical semiring, or an unambiguous weighted automaton over an arbitrary...