G05B 2219/23284
Eliminate redundant states in finite state machine
G05B2219/23284 (Eliminate redundant states in finite state machine) appears on 2 US grants and 1 published applications in this corpus.
Search patents in G05B- Granted patents
- 2
- Published applications
- 1
- Assignees
- 2
- Inventors
- 7
- Latest grant
- 4 Dec 2007
Filings by year
| Year | Granted patents | Published applications |
|---|---|---|
| 2002 | 0 | 1 |
| 2003 | 0 | 0 |
| 2004 | 0 | 0 |
| 2005 | 0 | 0 |
| 2006 | 1 | 0 |
| 2007 | 1 | 0 |
By publication year.
Recent patents
- Processing system using bitmap array to compress deterministic finite automation state table allowing direct indexing4 Dec 2007US 7,305,383 B1Cisco Technology, Inc.
- Method of reducing finite controlling automata and corresponding computer-readable medium2 May 2006US 7,039,564 B2Siemens Aktiengesellschaft
Most cited
By later US patents
- Processing system using bitmap array to compress deterministic finite automation state table allowing direct indexing103US 7,305,383 B1Cisco Technology, Inc. · 2007
- Method of reducing finite controlling automata and corresponding computer-readable medium2US 7,039,564 B2Siemens Aktiengesellschaft · 2006