Acyclic automata with easy-to-find short regular expressions

Authors:
José João Morais;Nelma Moreira;Rogério Reis
Affiliations:
DCC-FC & LIACC, Universidade do Porto, Porto, Portugal;DCC-FC & LIACC, Universidade do Porto, Porto, Portugal;DCC-FC & LIACC, Universidade do Porto, Porto, Portugal
Venue:
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
Year:
2005

Citing 0
Cited 4

Provably Shorter Regular Expressions from Deterministic Finite Automata

DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Series-Parallel Automata and Short Regular Expressions

Fundamenta Informaticae
Optimal lower bounds on regular expression size using communication complexity

FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Series-Parallel Automata and Short Regular Expressions

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

Computing short regular expressions equivalent to a given finite automaton is a hard task. We present a class of acyclic automata for which it is easy-to-find a regular expression that has linear size. We call those automata UDR. A UDR automaton is characterized by properties of its underlying digraph. We give a characterisation theorem and an efficient algorithm to determine if an acyclic automaton is UDR, that can be adapted to compute an equivalent short regular expression.