The system described below was implemented using FSA Utilities [26], a package for implementing and manipulating
finite state automata, which provides possibilities for defining new regular expression operators.
Probabilistic finite state automata (PA) are one of the most widespread backgrounds that knowledges to researchers in computer science [2,6].
and Suguna P., A note on ambiguous probabilistic deterministic finite state automata, International Congress of Mathematics, Hyderabad, India, 7(2010), 19-27.
Identification of residual
finite state automata. Internal Report, Departamento de Sistemas Informaticos y Computacion, Universidad Politecnica de Valencia, Espana.
The Probabilistic Finite State Automata (PFSA) constructed here [2] for a given data are restricted to have, from each state at most one transition with a given output symbol.
[2] Murugesan N and Suguna P, Optimization of a Hidden Markov Model using Gaines construction of Probabilistic Finite State Automata, International Conference on Mathematics and Computer Science, Loyola College, Chennai, India, July, 2008.
This paper is concerned with the analysis of the worst case behavior of Hopcroft's algorithm for minimizing deterministic
finite state automata. We extend a result of Castiglione, Restivo and Sciortino.
Differently from 4-way automata, Wang automata directed by polite scanning strategies visit each position exactly once, and the next position function does not depend on the input symbol, like traditional
finite state automata on strings.
In order to perform the validation of key constraints, we represent the paths in key definitions by finite state automata: for a context path P, we have the automaton M = ([THETA], [SIGMA], [delta], e, F).
8 illustrates finite state automata that correspond to the (context, target and key) paths in [K.sub.1], [K.sub.2], [K.sub.3] and F[K.sub.4] of Example 4.