The Suffix Tree of a Tree and Minimizing Sequential Transducers

Forfattere

  • Dany Breslauer

DOI:

https://doi.org/10.7146/brics.v2i47.19948

Resumé

This paper gives a linear-time algorithm for the construction of the
suffix tree of a tree. The suffix tree of a tree is used to obtain an efficient
algorithm for the minimization of sequential transducers.

Downloads

Publiceret

1995-06-17

Citation/Eksport

Breslauer, D. (1995). The Suffix Tree of a Tree and Minimizing Sequential Transducers. BRICS Report Series, 2(47). https://doi.org/10.7146/brics.v2i47.19948

Nummer

Nr. 47 (1995): RS-47 The Suffix Tree of a Tree and Minimizing Sequential Transducers

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).