Maximal pattern complexity, dual system and pattern recognition
From MaRDI portal
Publication:714854
DOI10.1016/j.tcs.2012.06.033zbMath1251.68175MaRDI QIDQ714854
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
68R15: Combinatorics on words
68T10: Pattern recognition, speech recognition
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Related Items
Cites Work
- Behavior of various complexity functions
- Maximal pattern complexity of higher dimensional words
- Combinatorial lemmas and applications to dynamics
- Uniform sets and complexity
- Super-stationary set, subword problem and the complexity
- Some special Vapnik-Chervonenkis classes
- Combinatorial geometry problems in pattern recognition
- Language structure of pattern Sturmian words
- Maximal pattern complexity of two-dimensional words
- On the density of families of sets
- Maximal pattern complexity of words over \(\ell\) letters
- Three complexity functions
- Partitions by congruent sets and optimal positions
- Uniform sets and super-stationary sets over general alphabets
- On maximal pattern complexity of some automatic words
- Learnability and the Vapnik-Chervonenkis dimension
- Sequence entropy and the maximal pattern complexity of infinite words
- Maximal pattern complexity for discrete systems
- ON METRIC INVARIANTS OF ENTROPY TYPE
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
