Finite State Automata


Also found in: Dictionary.

Finite State Automata

References in periodicals archive ?
We assume the reader is familiar with the basic standard models of finite state automata (see e.
Finding the boundaries and identifying the links between clauses requires computational devices such as finite state automata (FSA) or pushdown automata (PDA).
Probabilistic finite state automata (PA) are one of the most widespread backgrounds that knowledges to researchers in computer science [2,6].
A note on ambiguous probabilistic deterministic finite state automata, International Congress of Mathematics, Hyderabad, India, 7(2010), 19-27.
Probabilistic finite state automata - Part I, IEEE Transactions on Pattern Analysis and Machine Intelligence, 27(2005), No.
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.
5] Suguna P and Murugesan N, Construction of Hidden Markov Model Using Probabilistic Finite State Automata, UGC Sponsored National Seminar on Computational Methods in Continuum Mechanics, March 2009, Government Arts College, Coimbatore, India.
An algorithm for the minimization of deterministic finite state automata that runs in time O(n log n) on automata with n states was given by Hopcroft (1971).
This approach is rooted in a natural analogy with string languages: for instance finite state automata read their input string using a fixed strategy, usually left-to-right.
For each node, conf is computed by executing the finite state automata that recognize the paths in the definition of K (or F K).
4] of Example 6 with their corresponding finite state automata (respectively [M.
iii) KeysFSA: Set of finite state automata describing the paths that appear in the keys and foreign keys.

Full browser ?