Translation of semi-extended regular expressions using linear forms
From MaRDI portal
Cites work
- Complementing deterministic Büchi automata in polynomial time
- Deciding synchronous Kleene algebra with derivatives
- Derivatives of Regular Expressions
- Engineering an \(\mathsf{LTL_f}\) synthesis tool
- From Spot 2.0 to Spot 2.10: What’s New?
- scientific article; zbMATH DE number 3862426 (Why is no real title available?)
- scientific article; zbMATH DE number 1973991 (Why is no real title available?)
- scientific article; zbMATH DE number 5585443 (Why is no real title available?)
- Minimization of symbolic automata
- On the equivalence of automata for KAT-expressions
- On the minimization problem for \(\omega \)-automata
- Partial derivatives of an extended regular expression
- Partial derivatives of regular expressions and finite automaton constructions
- Propositional dynamic logic of regular programs
- Tools and algorithms for the construction and analysis of systems. 13th international conference, TACAS 2007, held as part of the joint European conferences on theory and practice of software, ETAPS 2007, Braga, Portugal, March 24 -- April 1, 2007. Procee
- Translation of semi-extended regular expressions using derivatives
- Two routes to automata minimization and the ways to reach it efficiently
This page was built for publication: Translation of semi-extended regular expressions using linear forms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7319270)
