Study on speed-up of searching algorithms for regular expressions with boolean operations
| Project/Area Number |
18500010
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Single-year Grants |
|---|
| Section | 一般 |
|---|
| Research Field |
Fundamental theory of informatics
|
|---|
| Research Institution | Shinshu University |
|---|
Principal Investigator |
YAMAMOTO Hiroaki Shinshu University, Faculty of Engineering, Professor (10182643)
|
|---|
| Co-Investigator(Kenkyū-buntansha) |
MIYAZAKI Takashi Nagano National College of Technology, Professor (10141889)
|
|---|
| Project Period (FY) |
2006 – 2007
|
| Project Status |
Completed (Fiscal Year 2007)
|
| Budget Amount *help |
¥3,130,000 (Direct Cost: ¥2,800,000、Indirect Cost: ¥330,000)
Fiscal Year 2007: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000)
Fiscal Year 2006: ¥1,700,000 (Direct Cost: ¥1,700,000)
|
|---|
| Keywords | extended regular expression / pattern matching alucrithm / finite automaton / string matching algorithm / regular expression |
|---|
| Research Abstract |
Below are results obtained by this research project.
1. We developed an extended regular expression matching algorithm based on deterministic finite automata.
2. We extended our extended regular expression matching algorithm to solve regular expressions with all boolean operations, and evaluated the performance experimentally.
3. We developed a method to generate a compact deterministic finite automaton representation using a dual position automaton, and applied it to matching algorithms.
4. We developed an efficient translation algorithm from regular expressions into nondeterministic finite automata. This algorithm can be used in matching algorithms.
|
Report
(3 results)
Research Products
(16 results)
