scientific article; zbMATH DE number 1134629
From MaRDI portal
Publication:4382097
Recommendations
- Regular expression star-freeness is PSPACE-complete
- On minimizing regular expressions without Kleene star
- Extended regular expressions of arbitrary star degrees
- On average behaviour of regular expressions in strong star normal form
- Extended regular expressions of star degree at most two
- Extended automata-like regular expressions of star degree at most (2,1)
- Prefix-free regular languages and pattern matching
- Kleene star on unary regular languages
- Succinctness of the Complement and Intersection of Regular Expressions
- Succinctness of the complement and intersection of regular expressions
Cited in
(10)- On theory of regular languages with the Kleene star operation
- Regular expression star-freeness is PSPACE-complete
- Aperiodicity in Tree Automata
- Deciding FO-rewritability of Regular Languages and Ontology-Mediated Queries in Linear Temporal Logic
- The intersection problem for finite monoids
- Deciding regular intersection emptiness of complete problems for PSPACE and the polynomial hierarchy
- Optimizing the region algebra is PSPACE-complete
- Extended regular expressions of star degree at most two
- scientific article; zbMATH DE number 2086412 (Why is no real title available?)
- Deciding FO-definability of regular languages
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4382097)
