A novel algorithm for the conversion of shuffle regular expressions into non-deterministic finite automata
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...
| Main Authors: | , |
|---|---|
| פורמט: | Article |
| שפה: | English |
| יצא לאור: |
Maejo University
2013-10-01
|
| סדרה: | Maejo International Journal of Science and Technology |
| נושאים: | |
| גישה מקוונת: | http://www.mijst.mju.ac.th/vol7/396-407.pdf |