Simple-regular expressions and languages

Authors:
Yo-Sub Han;Gerhard Trippen;Derick Wood
Affiliations:
Intelligence and Interaction Research Center, Korea Institute of Science and Technology, Cheongnyang, Seoul, Korea;Sauder School of Business, University of British Columbia, Vancouver, BC, Canada;Department of Computer Science, Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong SAR
Venue:
Journal of Automata, Languages and Combinatorics
Year:
2007

Citing 15
Cited 0

Codes

Handbook of formal languages, vol. 1
One-unambiguous regular languages

Information and Computation
Deterministic generalized automata

Theoretical Computer Science
A fast bit-vector algorithm for approximate string matching based on dynamic programming

Journal of the ACM (JACM)
Characterization of Glushkov automata

Theoretical Computer Science
Programming Techniques: Regular expression search algorithm

Communications of the ACM
Automata, Languages, and Machines

Automata, Languages, and Machines
Theory of Computation: A Primer

Theory of Computation: A Primer
Theory of Codes

Theory of Codes
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
Thompson Languages

Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa
Follow automata

Information and Computation
A characterization of Thompson digraphs

Discrete Applied Mathematics
Introduction to Automata Theory, Languages, and Computation (3rd Edition)

Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Outfix-free regular languages and prime outfix-free decomposition

ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing

Quantified Score

Hi-index	0.00

Visualization

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.