Implementation of State Elimination Using Heuristics
From MaRDI portal
Recommendations
Cites work
- Boolean Matrices and the Stability of Neural Nets
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 194974 (Why is no real title available?)
- scientific article; zbMATH DE number 2201362 (Why is no real title available?)
- scientific article; zbMATH DE number 3251424 (Why is no real title available?)
- Implementation and Application of Automata
- Minimal NFA Problems are Hard
- Obtaining shorter regular expressions from finite-state automata
- One-unambiguous regular languages
- Programming Techniques: Regular expression search algorithm
- Provably Shorter Regular Expressions from Deterministic Finite Automata
- Series-Parallel Automata and Short Regular Expressions
- THE ABSTRACT THEORY OF AUTOMATA
Cited in
(6)- Descriptional complexity of regular languages
- Short Regular Expressions from Finite Automata: Empirical Results
- State elimination ordering strategies: some experimental results
- 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: Implementation of State Elimination Using Heuristics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3637355)
