Maximal pattern complexity, dual system and pattern recognition

DOI10.1016/J.TCS.2012.06.033MaRDI QIDQ714854zbMATH OpenOpenAlexFDO

Authors Yu-Mei Xue, Teturo Kamae

Publication date 11 October 2012

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2012.06.033

zbMATH Keywords

complexity \(p_\Omega\)

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Combinatorics on words (68R15)

Recommendations

• A family of two-dimensional words with maximal pattern complexity \(2k\)
• Sequence entropy and the maximal pattern complexity of infinite words
• Behavior of various complexity functions
• Two dimensional word with \(2k\) maximal pattern complexity
• Uniform sets and complexity

Cites work

• Behavior of various complexity functions
• Combinatorial geometry problems in pattern recognition
• Combinatorial lemmas and applications to dynamics
• Language structure of pattern Sturmian words
• Learnability and the Vapnik-Chervonenkis dimension
• Maximal pattern complexity for discrete systems
• Maximal pattern complexity of higher dimensional words
• Maximal pattern complexity of two-dimensional words
• Maximal pattern complexity of words over \(\ell\) letters
• ON METRIC INVARIANTS OF ENTROPY TYPE
• On maximal pattern complexity of some automatic words
• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
• On the density of families of sets
• Partitions by congruent sets and optimal positions
• Sequence entropy and the maximal pattern complexity of infinite words
• Some special Vapnik-Chervonenkis classes
• Super-stationary set, subword problem and the complexity
• Three complexity functions
• Uniform sets and complexity
• Uniform sets and super-stationary sets over general alphabets

Cited in

(3)

• Behavior of various complexity functions
• Uniform sets and complexity
• On the admissibility of some substitution sequences

This page was built for publication: Maximal pattern complexity, dual system and pattern recognition

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