A note on optimal parallel transformations of regular expressions to nondeterministic finite automata

DOI10.1016/0020-0190(89)90076-8zbMath0682.68060OpenAlexW3023789857MaRDI QIDQ1824394

Wojciech Rytter

Publication date: 1989

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(89)90076-8

zbMATH Keywords

parallel random-access machineP- RAMSedgewick's transformationtransformation of regular expressions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Related Items (4)

Parallel recognition and ranking of context-free languages ⋮ Parallel construction of minimal suffix and factor automata ⋮ Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays ⋮ An optimal parallel algorithm to convert a regular expression into its Glushkov automaton

Cites Work

• An introduction to parallelism in combinatorial optimization
• Optimal parallel generation of a computation tree form
• Parallelism in random access machines
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A note on optimal parallel transformations of regular expressions to nondeterministic finite automata