Simple-regular expressions and languages

Yo Sub Han, Gerhard Trippen, Derick Wood

Research output: Contribution to conferencePaper

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 Jan 1
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

Fingerprint

Formal languages
Finite automata

All Science Journal Classification (ASJC) codes

  • Software

Cite this

Han, Y. S., Trippen, G., & Wood, D. (2005). Simple-regular expressions and languages. 146-157. Paper presented at 7th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2005, Como, Italy.
Han, Yo Sub ; Trippen, Gerhard ; Wood, Derick. / Simple-regular expressions and languages. Paper presented at 7th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2005, Como, Italy.12 p.
@conference{66587198f0b14c7384060f0e93775b8b,
title = "Simple-regular expressions and languages",
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.",
author = "Han, {Yo Sub} and Gerhard Trippen and Derick Wood",
year = "2005",
month = "1",
day = "1",
language = "English",
pages = "146--157",
note = "7th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2005 ; Conference date: 30-06-2005 Through 02-07-2005",

}

Han, YS, Trippen, G & Wood, D 2005, 'Simple-regular expressions and languages' Paper presented at 7th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2005, Como, Italy, 05/6/30 - 05/7/2, pp. 146-157.

Simple-regular expressions and languages. / Han, Yo Sub; Trippen, Gerhard; Wood, Derick.

2005. 146-157 Paper presented at 7th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2005, Como, Italy.

Research output: Contribution to conferencePaper

TY - CONF

T1 - Simple-regular expressions and languages

AU - Han, Yo Sub

AU - Trippen, Gerhard

AU - Wood, Derick

PY - 2005/1/1

Y1 - 2005/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=33646419678&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33646419678&partnerID=8YFLogxK

M3 - Paper

SP - 146

EP - 157

ER -

Han YS, Trippen G, Wood D. Simple-regular expressions and languages. 2005. Paper presented at 7th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2005, Como, Italy.