Efficient storage for finite state machines
作者： Branimir Z. Lambov
DOI:
关键词:
摘要: A method of operating a storage finite state machine includes organizing information concerning an operation the in payload-transition matrix, which given number columns matrix reflect features and other describe valid transitions between states depending on input characters, compressing row-displaced format.
lens.org 参考文章(37)
Richard Theodore Gillam, Method, system, and program for generating a deterministic table to determine boundaries between characters ,(1999)
Christian Stary, Armin Beer, Joachim Manz, Stefan Mohacsi, Method for testing of software ,(2002)
Dante Malagrino, Silvano Gai, System and method for performing regular expression matching with high parallelism ,(2002)
Mehryar Mohri, Cyril Allauzen, Systems and methods for determining the determinizability of finite-state automata and transducers ,(2007)
Jeffrey S. Roe, Ian Gordon Barrett, Bernard Guay, Scott Arthur Muma, Gregory J. Erker, Michael James Smith, Serial data validity monitor ,(2004)
Michael J. Buehler, Hubert A. Miller, Michael A. Sweeney, Kathleen F. Bonaffini, Sidney F. Rudolph, Galen Plunkett, Andrew M. Bonaffini, Donald E. Wallis, Real-time control sequencer with state matrix logic ,(1988)
Robert Matthew Barrie, Ernest Peltzer, Michael Flanagan, Darren Williams, Stephen Gould, Apparatus and method for large hardware finite state machine with embedded equivalence classes ,(2004)
Eoghan Stack, Peter Furlong, Hana Hailichova, David John Law, Pattern matching using deterministic finite automata and organization of such automata ,(2005)
Ebrahim Mehran Mestchian, Vijay Raghavan, Stage evaluation of a state machine ,(2011)
Ashish A. Pandya, 100Gbps security and search architecture using programmable intelligent search memory ,(2011)