State elimination ordering strategies: some experimental results

MaRDI QIDQ4964020zbMATH OpenFDO

Authors Nelma Moreira, Davide Nabais, Rogério Reis

Publication date 24 February 2021

Full work available at URL https://arxiv.org/abs/1008.1656, http://eptcs.web.cse.unsw.edu.au/paper.cgi?DCFS2010.16

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Short Regular Expressions from Finite Automata: Empirical Results
• State elimination heuristics for short regular expressions
• Implementation of State Elimination Using Heuristics
• Provably Shorter Regular Expressions from Deterministic Finite Automata
• Implementation and Application of Automata

Cited in

(9)

• A characterization of Thompson digraphs.
• Provably Shorter Regular Expressions from Deterministic Finite Automata
• Simplifying regular expressions. A quantitative perspective
• Implementation of State Elimination Using Heuristics
• Short Regular Expressions from Finite Automata: Empirical Results
• A 1/(1-1/k)-optimal algorithm for regular expression grouping
• State elimination heuristics for short regular expressions
• Implementation and Application of Automata
• Small balanced vertex separators in NFA to regular expression conversion

This page was built for publication: State elimination ordering strategies: some experimental results

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4964020)