|
A novel algorithm for the conversion of shuffle regular expressions into non-deterministic finite automata |
|---|---|
| รหัสดีโอไอ | |
| Creator | 1. Ajay Kumar 2. Anil Kumar Verma |
| Title | A novel algorithm for the conversion of shuffle regular expressions into non-deterministic finite automata |
| Publisher | Maejo University |
| Publication Year | 2556 |
| Journal Title | Maejo International Journal of Science and Technology |
| Journal Vol. | 7 |
| Journal No. | 3 |
| Page no. | 396 |
| Keyword | regular expression,parallel regular expression,non-deterministic finite automaton,shuffle operator |
| ISSN | 1905-7873 |
| Abstract | Regular expressions with shuffle operators are widely used in diverse fields of computer science. The work presented here investigates the shuffling of regular expressions and their conversion into non-deterministic finite automata. The aim of the paper is to design a novel algorithm for constructing e -free non-deterministic finite automata from the shuffling of regular expressions. Non-deterministic finite automata generated using the proposed approach requires, in the worst case, 2m+s+1 states. This is a significant improvement over other existing approaches in the literature, where the number of states reaches 22(m+u+k+s)-C in the worst case. |
