Algorithms for checking intersection non-emptiness of regular expressions
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1962776 (Why is no real title available?)
- scientific article; zbMATH DE number 1775632 (Why is no real title available?)
- scientific article; zbMATH DE number 7354705 (Why is no real title available?)
- scientific article; zbMATH DE number 3251424 (Why is no real title available?)
- A decision procedure for regular membership and length constraints over unbounded strings
- A mesh of automata
- Canonical derivatives, partial derivatives and finite automaton constructions.
- Derivatives and finite automata of expressions in star normal form
- Derivatives of Regular Expressions
- Derivatives of regular expressions and an application
- Follow automata.
- From regular expressions to deterministic automata
- Hardness results for intersection non-emptiness
- Language operations with regular expressions of polynomial size
- NORMALIZED EXPRESSIONS AND FINITE AUTOMATA
- On the Fine Grained Complexity of Finite Automata Non-emptiness of Intersection
- On the equivalence, containment, and covering problems for the regular and context-free languages
- One-unambiguous regular languages
- Partial derivatives of an extended regular expression
- Partial derivatives of regular expressions and finite automaton constructions
- Position automaton construction for regular expressions with intersection
- Regular expressions into finite automata
- THE ABSTRACT THEORY OF AUTOMATA
- The passing of a rational expression to a nondeterministic finite automaton
- Towards more efficient methods for solving regular-expression heavy string constraints
- VATA: A Library for Efficient Manipulation of Non-deterministic Tree Automata
This page was built for publication: Algorithms for checking intersection non-emptiness of regular expressions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6605358)
