| Presentation | 2005-06-23 An Extended Regular Expression Matching System which can Dynamically Define operations Yoshifumi OKADA, Hiroaki YAMAMOTO, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | This paper is concerned with an extended regular expression (ERE) matching system which can use any boolean operations. Yamamoto presented an automata-based algorithm for solving an ERE membership problem, where EREs are defined to be regular expressions with intersection and complement. We extend this algorithm so that it can make use of any boolean operations. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | extended regular expression / pattern matching algorithm / finite automata |
| Paper # | SS2005-16 |
| Date of Issue |
| Conference Information | |
| Committee | SS |
|---|---|
| Conference Date | 2005/6/16(1days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Chair | |
| Vice Chair | |
| Secretary | |
| Assistant | |
| Paper Information | |
| Registration To | Software Science (SS) |
|---|---|
| Language | JPN |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | An Extended Regular Expression Matching System which can Dynamically Define operations |
| Sub Title (in English) | |
| Keyword(1) | extended regular expression |
| Keyword(2) | pattern matching algorithm |
| Keyword(3) | finite automata |
| 1st Author's Name | Yoshifumi OKADA |
| 1st Author's Affiliation | Faculty of Engineering, Shinshu University() |
| 2nd Author's Name | Hiroaki YAMAMOTO |
| 2nd Author's Affiliation | Faculty of Engineering, Shinshu University |
| Date | 2005-06-23 |
| Paper # | SS2005-16 |
| Volume (vol) | vol.105 |
| Number (no) | 128 |
| Page | pp.pp.- |
| #Pages | 6 |
| Date of Issue | |