Complexity functions for two-dimensional sequences

MaRDI QIDQ2765706zbMATH OpenFDO

Authors Zoltán Kása

Publication date 24 January 2002

zbMATH Keywords

enumerationfunctions of two-dimensional sequences

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Irregularities of distribution, discrepancy (11K38) Formal languages and automata (68Q45) Combinatorics on words (68R15)

Review text

The note consists only of the following abstract: Complexity functions which count the number of different subsequences of the same length of finite and infinite sequences, and functions which count the number of all subsequences in finite sequences are well known. We generalize these functions of two-dimensional sequences.NEWLINENEWLINEFor the entire collection see [Zbl 0971.00050].

Recommendations

• On the complexity of infinite sequences
• Sequences with subword complexity \(2n\)
• A family of two-dimensional words with maximal pattern complexity \(2k\)
• scientific article; zbMATH DE number 5855012
• scientific article; zbMATH DE number 3890728

Cited in

(4)

• scientific article; zbMATH DE number 5855012 (Why is no real title available?)
• scientific article; zbMATH DE number 5501412 (Why is no real title available?)
• scientific article; zbMATH DE number 6130246 (Why is no real title available?)
• The subword complexity of a two-parameter family of sequences

This page was built for publication: Complexity functions for two-dimensional sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2765706)