Parallel construction of minimal suffix and factor automata (Q911778): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3690245 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel construction of a suffix tree with applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: The smallest automaton recognizing the subwords of a text / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete inverted files for efficient text retrieval and analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3690247 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3795244 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Correction: Parallel Merge Sort / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transducers and repetitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3355232 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992991 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4125823 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Pattern Matching in Strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3783605 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Space-Economical Suffix Tree Construction Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on optimal parallel transformations of regular expressions to nondeterministic finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Parallel Biconnectivity Algorithm / rank
 
Normal rank

Revision as of 15:19, 20 June 2024

scientific article
Language Label Description Also known as
English
Parallel construction of minimal suffix and factor automata
scientific article

    Statements

    Parallel construction of minimal suffix and factor automata (English)
    0 references
    0 references
    0 references
    1990
    0 references
    formal languages
    0 references
    finite automata
    0 references
    parallel agorithms
    0 references
    concurrent-write model
    0 references
    exclusive-write model
    0 references

    Identifiers