We define simple-regular expressions and languages. Simple-regular languages provide a necessary condition for a language to be outfix-free. We design algorithms that compute simple-regular languages from finite-state automata. Furthermore, we investigate the complexity blowup from a given finite-state automaton to its simple-regular language automaton and show that there is an exponential blowup. In addition, we present a finite-state automata construction for simple-regular expressions based on state expansion.
|Number of pages||12|
|Publication status||Published - 2005|
|Event||7th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2005 - Como, Italy|
Duration: 2005 Jun 30 → 2005 Jul 2
|Other||7th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2005|
|Period||05/6/30 → 05/7/2|
All Science Journal Classification (ASJC) codes