Recently, Yamamoto presented a new method for the conversion from regular expressions (REs) to non-deterministic finite automata (NFA) based on the Thompson ε-NFA (AT). The AT automaton has two quotients discussed: the suffix automaton Asuf and the prefix automaton, Apre. Eliminating ε-transitions in AT, the Glushkov automaton (Apos) is obtained. Thus, it is easy to see that Asuf and the partia...

Finite tree automata consist of a set of states and a set of transitions. Input trees are accepted if it is possible to label the tree with states such that the relationship between the state at every node and the state at its child nodes conforms to a transition. Thus, the transitions only define how a state must be labeled with respect to its children or vice versa. This work investigates how...

To each one-dimensional subshift $X$, we may associate a winning shift $W(X)$ which arises from combinatorial game played on the language of $X$. Previously it has been studied what properties $X$ does inherit. For example, and have same factor complexity if is sofic subshift, then also sofic. In this paper, develop notion automaticity for $W(X)$, that is, propose means vector representation ac...

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...

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 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...

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 ...