Fast equation automaton computation

DOI10.1016/j.jda.2007.10.003zbMath1160.68416OpenAlexW2009863448MaRDI QIDQ1018095

Ahmed Khorsi, Djelloul Ziadi, Faissal Ouardi

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

zbMATH Keywords

algorithmsregular expressionsfinite automata

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Combinatorics on words (68R15) Formal languages and automata (68Q45)

Related Items (6)

Manipulation of regular expressions using derivatives: an overview ⋮ Location automata for regular expressions with shuffle and intersection ⋮ Extended to multi-tilde-bar regular expressions and efficient finite automata constructions ⋮ On the size of partial derivatives and the word membership problem ⋮ An Efficient Algorithm for the Construction of the Equation Tree Automaton ⋮ Partial derivative automaton by compressing regular expressions

Cites Work

• Unnamed Item
• Unnamed Item
• Partial derivatives of regular expressions and finite automaton constructions
• Minimisation of acyclic deterministic automata in linear time
• The passing of a rational expression to a nondeterministic finite automaton
• Regular expressions into finite automata
• From regular expressions to DFA's using compressed NFA's
• Canonical derivatives, partial derivatives and finite automaton constructions.
• Linear Automaton Transformations
• Three Partition Refinement Algorithms

This page was built for publication: Fast equation automaton computation