Fast equation automaton computation
From MaRDI portal
Publication:1018095
DOI10.1016/J.JDA.2007.10.003zbMATH Open1160.68416OpenAlexW2009863448MaRDI QIDQ1018095FDOQ1018095
Authors: Ahmed Khorsi, Faissal Ouardi, Djelloul Ziadi 
Publication date: 13 May 2009
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2007.10.003
Recommendations
Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Combinatorics on words (68R15)
Cites Work
- Title not available (Why is that?)
- Partial derivatives of regular expressions and finite automaton constructions
- Three Partition Refinement Algorithms
- Minimisation of acyclic deterministic automata in linear time
- Linear Automaton Transformations
- Regular expressions into finite automata
- The passing of a rational expression to a nondeterministic finite automaton
- Canonical derivatives, partial derivatives and finite automaton constructions.
- From regular expressions to DFA's using compressed NFA's
- From Mirkin's prebases to Antimirov's word partial derivatives
Cited In (9)
- Title not available (Why is that?)
- Location automata for regular expressions with shuffle and intersection
- An efficient algorithm for the equation tree automaton via the \(k\)-c-continuations
- On the size of partial derivatives and the word membership problem
- An efficient algorithm for the construction of the equation tree automaton
- Manipulation of regular expressions using derivatives: an overview
- Extended to multi-tilde-bar regular expressions and efficient finite automata constructions
- FROM C-CONTINUATIONS TO NEW QUADRATIC ALGORITHMS FOR AUTOMATON SYNTHESIS
- Partial derivative automaton by compressing regular expressions
This page was built for publication: Fast equation automaton computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1018095)
