Ternary directed acyclic word graphs (Q703500): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2004.07.008 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2154517803 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501814 / 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: Transducers and repetitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4849531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Jewels of Stringology / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms on Strings, Trees and Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4547748 / 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: Minimisation of acyclic deterministic automata in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line construction of suffix trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate string matching with suffix automata / rank
 
Normal rank

Latest revision as of 17:09, 7 June 2024

scientific article
Language Label Description Also known as
English
Ternary directed acyclic word graphs
scientific article

    Statements

    Ternary directed acyclic word graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    11 January 2005
    0 references
    0 references
    Deterministic finite state automata
    0 references
    Pattern matching on strings
    0 references
    Directed acyclic word graphs
    0 references
    Ternary search trees
    0 references
    AVL trees
    0 references
    0 references