Finite state automaton with multiple state types

Details Finite state automaton with multiple state types Finite state automaton with multiple state types

1978-10-12

1980-12-23

Stewart, David L.

Boots, shoes, and leggings

370100, G06F 722

Patent

active

042414024

ABSTRACT:
The subject of this disclosure is a Finite State Automaton (FSA) used as part of a term detector employed in a digital pattern search system (searcher). In particular the invention includes various advances in the art of FSA design which make the FSA practical for pattern recognition.
Specifically, these advances minimize the amount of memory which is required in each FSA in performing pattern recognition, and allow a speed capability such that the searching can be performed at the rate at which a mass storage medium can supply data. The large amount of memory required and the low speed of processing in the prior state of the art made the use of an FSA impractical for most real applications.
The new advances include the following:

REFERENCES:
patent: 3435423 (1969-03-01), Fuller
patent: 3568156 (1971-03-01), Thompson
Communications of the ACM, "A Generalized Technique for Symbol Manipulation . . . ", by Douglas T. Ross, presented 5/20-21/60.
Communications of the ACM; vol. 11, No. 12, Dec. 1968; "Automatic Generation of Efficient Lexical Processors", by Johnson et al.

Affiliated with

Also associated with

Rating

Finite state automaton with multiple state types does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Finite state automaton with multiple state types, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Finite state automaton with multiple state types will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2245991