Counting Distinct Strings | Zendy

Dennis Moore | Zendy; W.F. Smyth | Zendy; David F. Miller | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Counting Distinct Strings

Author(s) -

Dennis Moore,

W.F. Smyth,

David F. Miller

Publication year - 1999

Publication title -

algorithmica

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.647

H-Index - 78

eISSN - 1432-0541

pISSN - 0178-4617

DOI - 10.1007/pl00009247

Subject(s) - combinatorics , alphabet , string (physics) , constant (computer programming) , mathematics , function (biology) , theory of computation , integer (computer science) , discrete mathematics , algorithm , computer science , philosophy , linguistics , evolutionary biology , mathematical physics , biology , programming language

This paper discusses how to count and generate strings that are "distinct" in twosenses: p-distinct and b-distinct. Two strings x on alphabet A and x0on alphabet A0are said to be p-distinct iff they represent distinct "patterns"; that is, iff there existsno one-one mapping from A to A0that transforms x into x0. Thus aab and baa arep-distinct while aab and ddc are p-equivalent. On the other hand, x and x0are said tobe b-distinct iff they give rise to distinct border...

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research