On minimizing regular expressions without Kleene star
From MaRDI portal
Publication:2140503
DOI10.1007/978-3-030-86593-1_17OpenAlexW3199494969MaRDI QIDQ2140503
Simon Wolfsteiner, Markus Holzer, Hermann Gruber
Publication date: 20 May 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-86593-1_17
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Which problems have strongly exponential complexity?
- On minimal grammar problems for finite languages
- Problems on finite automata and the exponential time hypothesis
- On the compressibility of finite languages and formal proofs
- Enumerating regular expressions and their languages
- Two-dimensional pattern matching against basic picture languages
- Language operations with regular expressions of polynomial size
- Minimizing nfa's and regular expressions
- Nearly Tight Approximability Results for Minimum Biclique Cover and Partition
- If the Current Clique Algorithms Are Optimal, so Is Valiant's Parser
- On the Fine Grained Complexity of Finite Automata Non-emptiness of Intersection
- ON SOME FINE-GRAINED QUESTIONS IN ALGORITHMS AND COMPLEXITY
- Hardness Results for Intersection Non-Emptiness
- Inapproximability of Nondeterministic State and Transition Complexity Assuming P ≠ NP
This page was built for publication: On minimizing regular expressions without Kleene star
