Small balanced vertex separators in NFA to regular expression conversion

DOI10.1007/978-3-031-97100-6_15MaRDI QIDQ6884651zbMATH OpenFDO

Authors Derek Youngman, Kai Salomaa

Publication date 15 December 2025

Full work available at URL https://doi.org/10.1007/978-3-031-97100-6_15

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A first course in graph theory and combinatorics
• A Separator Theorem for Planar Graphs
• Enumeration and generation with a string automata representation
• From finite automata to regular expressions and back -- a summary on descriptional complexity
• scientific article; zbMATH DE number 2201362 (Why is no real title available?)
• Implementation and Application of Automata
• Implementation and Application of Automata
• Implementation of State Elimination Using Heuristics
• Minimal NFA Problems are Hard
• Obtaining shorter regular expressions from finite-state automata
• On classes of graphs with strongly sublinear separators
• Provably shorter regular expressions from finite automata
• Short Regular Expressions from Finite Automata: Empirical Results
• State elimination ordering strategies: some experimental results

This page was built for publication: Small balanced vertex separators in NFA to regular expression conversion

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