Series-Parallel Automata and Short Regular Expressions

DOI10.3233/FI-2009-0061MaRDI QIDQ3633925zbMATH OpenOpenAlexFDO

Authors Nelma Moreira, Rogério Reis

Publication date 23 June 2009

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/fi-2009-0061

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Short Regular Expressions from Finite Automata: Empirical Results
• Provably shorter regular expressions from finite automata
• From regular expressions to finite automata^∗
• scientific article; zbMATH DE number 3915652
• Regular expressions into finite automata
• Implementation and Application of Automata
• More Concise Representation of Regular Languages by Automata and Regular Expressions
• More concise representation of regular languages by automata and regular expressions
• Compact representations of automata for regular expression matching
• From regular expressions to deterministic automata

Cited in

(4)

• Efficient weighted expressions conversion
• Implementation of State Elimination Using Heuristics
• Series parallel digraphs with loops
• Implementation and Application of Automata

This page was built for publication: Series-Parallel Automata and Short Regular Expressions

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