Simple-regular expressions and languages

Yo Sub Han, Gerhard Trippen, Derick Wood

Research output: Contribution to conferencePaperpeer-review

2 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages146-157
Number of pages12
Publication statusPublished - 2005
Event7th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2005 - Como, Italy
Duration: 2005 Jun 302005 Jul 2

Other

Other7th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2005
CountryItaly
CityComo
Period05/6/3005/7/2

All Science Journal Classification (ASJC) codes

  • Software

Fingerprint Dive into the research topics of 'Simple-regular expressions and languages'. Together they form a unique fingerprint.

Cite this