Short Regular Expressions from Finite Automata: Empirical Results

DOI10.1007/978-3-642-02979-0_22zbMath1248.68296OpenAlexW1849520586MaRDI QIDQ3637356

Hermann Gruber, Markus Holzer, Michael Tautschnig

Publication date: 9 July 2009

Published in: Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02979-0_22

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

Automata and rational expressions ⋮ Descriptional complexity of regular languages

Uses Software

• GenRGenS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Obtaining shorter regular expressions from finite-state automata
• Complexity measures for regular expressions
• Planarization and fragmentability of some classes of graphs
• Enumeration and generation with a string automata representation
• Transition graphs and the star-height of regular events
• Finite Automata, Digraph Connectivity, and Regular Expression Size
• Provably Shorter Regular Expressions from Deterministic Finite Automata
• Improved Approximation Algorithms for Minimum Weight Vertex Separators
• Optimal Lower Bounds on Regular Expression Size Using Communication Complexity
• Implementation and Application of Automata
• Implementation and Application of Automata

This page was built for publication: Short Regular Expressions from Finite Automata: Empirical Results