Title :
Searching for a minimal finite state automaton (FSA)
Author :
Puri, Ruchir ; Gu, Jun
Author_Institution :
Dept. of Electr. & Comput. Eng., Calgary Univ., Alta., Canada
Abstract :
An efficient algorithm to search for a minimal finite state automaton (FSA) is presented. This algorithm eliminates all the redundant states in a given FSA and is guaranteed to produce an optimal solution for a reduced FSA. The performance is achieved because of the application of a fail-first heuristics in search tree level and nodal ordering and taking advantage of an efficient search space pruning criterion in search tree generation and in the search process
Keywords :
finite automata; heuristic programming; search problems; fail-first heuristics; minimal finite state automaton; nodal ordering; optimal solution; search problems; search tree generation; Artificial intelligence; Circuits; Computational modeling; Computer science; Computer simulation; Learning automata; Machine learning; Machine learning algorithms; Merging;
Conference_Titel :
Tools for Artificial Intelligence, 1991. TAI '91., Third International Conference on
Conference_Location :
San Jose, CA
Print_ISBN :
0-8186-2300-4
DOI :
10.1109/TAI.1991.167123
