A process-oriented implementation of Brzozowski's DFA construction algorithm

T. Strauss, D.G. Kourie, B.W. Watson, L.G. Cleophas

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

2 Citations (Scopus)
1 Downloads (Pure)


A process-algebraic description of Brzozowski's deterministic finite automaton construction algorithm, slightly adapted from a previous version, shows how the algorithm can be structured as a set of communicating processes. This description was used to guide a process-oriented implementation of the algorithm. The performance of the process-oriented algorithm is then compared against the sequential version for a statistically significant number of randomly generated regular expressions. It is shown that the concurrent version of the algorithm outperforms the sequential version both on a multi-processor machine as well as on a single-processor multi-core machine. This is despite the fact that processor allocation and process scheduling cannot be user-optimised but are, instead, determined by the operating system.
Original languageEnglish
Title of host publicationProceedings of the Proceedings of the Prague Stringology Conference 2014
EditorsJ. Holub, J. Žďárek
Place of PublicationPrague
PublisherPrague Stringology Club
Number of pages13
Publication statusPublished - 2014
Externally publishedYes
EventPrague Stringology Conference 2014 - Department of Theoretical Computer Science, Czech Technical University, Prague, Czech Republic
Duration: 1 Sept 20143 Sept 2015


ConferencePrague Stringology Conference 2014
Country/TerritoryCzech Republic


Dive into the research topics of 'A process-oriented implementation of Brzozowski's DFA construction algorithm'. Together they form a unique fingerprint.

Cite this