Approximation to the smallest regular expression for a given regular language
From MaRDI portal
Recommendations
- Approximate regular expressions and their derivatives
- Asymptotic approximation by regular languages
- scientific article; zbMATH DE number 6136496
- Optimal Lower Bounds on Regular Expression Size Using Communication Complexity
- Approximate matching of regular expressions
- From regular expressions to smaller NFAs
- Tight Bounds on the Descriptional Complexity of Regular Expressions
- Closest substring problems for regular languages
- Closest substring problems for regular languages
- Short Regular Expressions from Finite Automata: Empirical Results
Cited in
(14)- Acyclic automata and small expressions using multi-tilde-bar operators
- Automata and rational expressions
- Descriptional complexity of regular languages
- Computing relative Abelian kernels of finite monoids.
- Provably Shorter Regular Expressions from Deterministic Finite Automata
- A New Family of Regular Operators Fitting with the Position Automaton Computation
- Multi-tilde Operators and Their Glushkov Automata
- Implementation of State Elimination Using Heuristics
- Short Regular Expressions from Finite Automata: Empirical Results
- Small Extended Expressions for Acyclic Automata
- On regular expression hashing to reduce FA size
- Optimal Lower Bounds on Regular Expression Size Using Communication Complexity
- Small balanced vertex separators in NFA to regular expression conversion
- Obtaining shorter regular expressions from finite-state automata
This page was built for publication: Approximation to the smallest regular expression for a given regular language
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5463995)