An optimal parallel algorithm to convert a regular expression into its Glushkov automaton

DOI10.1016/S0304-3975(97)00131-XzbMath0915.68086MaRDI QIDQ1285572

Djelloul Ziadi, Jean-Marc Champarnaud

Publication date: 28 April 1999

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

regular expressionsfinite automataPRAM algorithms

Mathematics Subject Classification ID

Distributed algorithms (68W15)

Related Items

A CONCURRENT SPECIFICATION OF BRZOZOWSKI'S DFA CONSTRUCTION ALGORITHM ⋮ Local languages and the Berry-Sethi algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The passing of a rational expression to a nondeterministic finite automaton
• Regular expressions into finite automata
• A note on optimal parallel transformations of regular expressions to nondeterministic finite automata
• THE ABSTRACT THEORY OF AUTOMATA
• Optimal parallel generation of a computation tree form
• From regular expressions to finite automata^∗
• Programming Techniques: Regular expression search algorithm