Data processing: artificial intelligence – Miscellaneous
Reexamination Certificate
2004-12-09
2011-10-04
Rivas, Omar Fernandez (Department: 2122)
Data processing: artificial intelligence
Miscellaneous
C706S045000
Reexamination Certificate
active
08032479
ABSTRACT:
A string matching system comprises a state transition table generator for generating a state transition table based on a matching condition described in a regular expression, and an automaton for including a state that makes a transition according to the state transition table generated by the state transition table generator; if, in the state transition table generated based on the matching condition, there exists no next transition destination state with respect to a current-state and input-characters tuple, the automaton makes a transition to the initial state without proceeding to read input characters.Furthermore, the string matching system comprises a state transition table generator for generating a state transition table based on matching conditions described in a regular expression, and an automaton that makes a transition according to the state transition table generated by the state transition table generator; if no next-transition destination state with respect to a current-state and input-character tuple exists in the state transition table generated based on the matching condition, then the state transition table generator determines an exclusion character based on which the automaton make a transition to a predetermined state without proceeding to read input characters, to generate a state transition table.
REFERENCES:
patent: 4764863 (1988-08-01), Silverthorn et al.
patent: 5051886 (1991-09-01), Kawaguchi et al.
patent: 5278981 (1994-01-01), Kawaguchi et al.
patent: 5995963 (1999-11-01), Nanba et al.
patent: 7539681 (2009-05-01), Norton et al.
patent: 7552051 (2009-06-01), Privault et al.
patent: 2003/0051043 (2003-03-01), Wyschogrod et al.
patent: 2003/0065800 (2003-04-01), Wyschogrod et al.
patent: 2004/0117184 (2004-06-01), Privault et al.
patent: 2005/0035784 (2005-02-01), Gould et al.
patent: 2005/0273450 (2005-12-01), McMillen et al.
patent: 2006/0101195 (2006-05-01), Jain
patent: 2008/0077587 (2008-03-01), Wyschogrod et al.
patent: 7-129369 (1995-05-01), None
patent: 10-105576 (1998-04-01), None
patent: 10-207912 (1998-08-01), None
patent: 2004-103034 (2004-04-01), None
patent: 2004-103035 (2004-04-01), None
Sengoku, “Minimization of Nondeterministic Finite Automata”, Kyoto University, 1992, pp. 1-42.
CodeCharge, www.support.yessoftware.com/kb—article.asp?article—id=63&printable=1, 2002, pp. 1-3.
Masui, “Compressing State Transition Tables and Tries,” Sharp Corporation, Jan. 1994, pp. 73-80.
Hopcroft et al., “Formal Languages and their Relation to Automata,” Chapter 3, pp. 26-41, Addison Wesley , 1969.
Birch & Stewart Kolasch & Birch, LLP
Fernandez Rivas Omar
Mitsubishi Electric Corporation
LandOfFree
String matching system and program therefor does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with String matching system and program therefor, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and String matching system and program therefor will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4290566