Optimal superprimitivity testing for strings (Q811134): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient detection of quasiperiodicities in strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal off-line detection of repetitions in a string / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3659988 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The equation \(a_ M=b^ Nc^ P\) in a free group / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Pattern Matching in Strings / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0020-0190(91)90056-n / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2056819372 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:31, 30 July 2024

scientific article
Language Label Description Also known as
English
Optimal superprimitivity testing for strings
scientific article

    Statements

    Optimal superprimitivity testing for strings (English)
    0 references
    0 references
    0 references
    0 references
    1991
    0 references
    algorithms on words
    0 references
    superprimitive strings
    0 references
    period of string
    0 references
    quasiperiod of a string
    0 references

    Identifiers