An optimal parallel algorithm to convert a regular expression into its Glushkov automaton
type: Item
instance of: scholarly article
title: An optimal parallel algorithm to convert a regular expression into its Glushkov automaton
zbMATH Open document ID: 0915.68086
DOI: 10.1016/S0304-3975(97)00131-X
author: Djelloul Ziadi
author: Jean-Marc Champarnaud
published in: Theoretical Computer Science
publication date: 1999-04-28T00:00:00Z
Mathematics Subject Classification ID: 68W15
zbMATH DE Number: 1281073
zbMATH Keywords: PRAM algorithms
zbMATH Keywords: regular expressions
zbMATH Keywords: finite automata
MaRDI profile type: Publication
cites work: Optimal parallel generation of a computation tree form
cites work: Regular expressions into finite automata
cites work: Q3992991
cites work: THE ABSTRACT THEORY OF AUTOMATA
cites work: Q3862379
cites work: Q5536277
cites work: From regular expressions to finite automata∗
cites work: A note on optimal parallel transformations of regular expressions to nondeterministic finite automata
cites work: Q3311639
cites work: Programming Techniques: Regular expression search algorithm
cites work: Q4848749
cites work: The passing of a rational expression to a nondeterministic finite automaton
description: scientific article; zbMATH DE number 1281073