Fast equation automaton computation
type: Item
instance of: scholarly article
title: Fast equation automaton computation
zbMATH Open document ID: 1160.68416
author: Ahmed Khorsi
author: Faissal Ouardi
author: Djelloul Ziadi
published in: Journal of Discrete Algorithms
publication date: 2009-05-13T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68R15
Mathematics Subject Classification ID: 68W30
zbMATH DE Number: 5553597
zbMATH Keywords: finite automata
zbMATH Keywords: regular expressions
zbMATH Keywords: algorithms
MaRDI profile type: Publication
full work available at URL: j.jda.2007.10.003
OpenAlex ID: W2009863448
cites work: Partial derivatives of regular expressions and finite automaton constructions
cites work: Regular expressions into finite automata
cites work: Canonical derivatives, partial derivatives and finite automaton constructions.
cites work: From Mirkin's prebases to Antimirov's word partial derivatives
cites work: From regular expressions to DFA's using compressed NFA's
cites work: Linear Automaton Transformations
cites work: Three Partition Refinement Algorithms
cites work: Minimisation of acyclic deterministic automata in linear time
cites work: Q4714446
cites work: The passing of a rational expression to a nondeterministic finite automaton
DOI: 10.1016/J.JDA.2007.10.003
description: scientific article; zbMATH DE number 5553597