Simple-Regular Expressions and Languages.
ABSTRACT We define simple-regular expressions and languages. Simple-regular languages pro- vide a necessary condition for a language to be outfix-free. We design algorithms that compute simple-regular languages from finite-state automata. Furthermore, we inves- tigate 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.
- 01/2000; Addison-Wesley.
- Int. J. Found. Comput. Sci. 01/2006; 17:379-394.
Conference Proceeding: Thompson Languages.Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa; 01/1999