Optimal Parallel Construction of Minimal Suffix and Factor Automata

Forfattere

  • Dany Breslauer
  • Ramesh Hariharan

DOI:

https://doi.org/10.7146/brics.v2i16.19884

Resumé

This paper gives optimal parallel algorithms for the construction of the smallest deterministic finite automata recognizing all the suffixes and the factors of a string. The algorithms use recently discovered optimal parallel suffix tree construction algorithms together with data structures for the efficient manipulation of trees, exploiting the well known relation between suffix and factor automata and suffix trees.

Downloads

Publiceret

1995-01-16

Citation/Eksport

Breslauer, D., & Hariharan, R. (1995). Optimal Parallel Construction of Minimal Suffix and Factor Automata. BRICS Report Series, 2(16). https://doi.org/10.7146/brics.v2i16.19884

Nummer

Nr. 16 (1995): RS-16 Optimal Parallel Construction of Minimal Suffix and Factor Automata

Sektion

Artikler

Licens

Authors who publish with this journal agree to the following terms:

    1. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.

    1. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.

  1. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).