COMPARING SUBWORD OCCURRENCES IN BINARY D0L SEQUENCES (Q3401488): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some characterizations of Parikh matrix equivalent binary words / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sharpening of the Parikh mapping / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subword histories and Parikh matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: MATRIX INDICATORS FOR SUBWORD OCCURRENCES AND AMBIGUITY / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Context-Free Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4746787 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connections between subwords and certain matrix mappings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independence of certain quantities indicating subword occurrences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subword conditions and subword histories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extending Parikh matrices / rank
 
Normal rank

Latest revision as of 11:00, 2 July 2024

scientific article
Language Label Description Also known as
English
COMPARING SUBWORD OCCURRENCES IN BINARY D0L SEQUENCES
scientific article

    Statements

    COMPARING SUBWORD OCCURRENCES IN BINARY D0L SEQUENCES (English)
    0 references
    29 January 2010
    0 references
    subword
    0 references
    scattered subword
    0 references
    subword balance
    0 references
    iterated morphism
    0 references
    D0L system
    0 references
    Parikh matrix
    0 references
    0 references

    Identifiers