Incremental algorithms for solving regular expression intersection non-emptiness

Cites work

scientific article; zbMATH DE number 3560737 (Why is no real title available?)
scientific article; zbMATH DE number 1962776 (Why is no real title available?)
scientific article; zbMATH DE number 1962812 (Why is no real title available?)
scientific article; zbMATH DE number 1775632 (Why is no real title available?)
scientific article; zbMATH DE number 941396 (Why is no real title available?)
scientific article; zbMATH DE number 2086619 (Why is no real title available?)
scientific article; zbMATH DE number 7354705 (Why is no real title available?)
A decision procedure for regular membership and length constraints over unbounded strings
A mesh of automata
A symbolic decision procedure for symbolic alternating finite automata
Algorithms for checking intersection non-emptiness of regular expressions
Antichain algorithms for finite automata
Antichain with SAT and tries
Antichains: A New Algorithm for Checking Universality of Finite Automata
Automata terms in a lazy \(\mathrm{WS}k\mathrm{S}\) decision procedure
Canonical derivatives, partial derivatives and finite automaton constructions.
Combinatorial Pattern Matching
Deciding Kleene algebras in \texttt{Coq}
Derivatives and finite automata of expressions in star normal form
Derivatives of Regular Expressions
Descriptional and computational complexity of finite automata -- a survey
Even Faster Conflicts and Lazier Reductions for String Solvers
FROM C-CONTINUATIONS TO NEW QUADRATIC ALGORITHMS FOR AUTOMATON SYNTHESIS
Follow automata.
Foundation for a series of efficient simulation algorithms
From regular expressions to deterministic automata
Hardness results for intersection non-emptiness
Intersection non-emptiness and hardness within polynomial time
Language operations with regular expressions of polynomial size
Mathematical Foundations of Computer Science 2004
Minimal NFA Problems are Hard
NFA reduction algorithms by means of regular inequalities
NORMALIZED EXPRESSIONS AND FINITE AUTOMATA
Nested antichains for WS1S
On the Fine Grained Complexity of Finite Automata Non-emptiness of Intersection
On the average complexity of partial derivative automata for semi-extended expressions
On the complexity of intersecting finite state automata and \(\mathcal{NL}\) versus \(\mathcal{NP}\)
On the complexity of intersection non-emptiness for star-free language classes
Partial derivatives of an extended regular expression
Partial derivatives of regular expressions and finite automaton constructions
Position automaton construction for regular expressions with intersection
Problems on finite automata and the exponential time hypothesis
Proving language inclusion and equivalence by coinduction
Regular expressions into finite automata
Regular expressions: new results and open problems
Succinct representations of graphs
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
When simulation meets antichains. (On checking language inclusion of nondeterministic finite (tree) automata)

This page was built for publication: Incremental algorithms for solving regular expression intersection non-emptiness

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6985825)