Super-stationary set, subword problem and the complexity
From MaRDI portal
Publication:1043967
DOI10.1016/J.DISC.2009.02.001zbMath1217.68173OpenAlexW2106784380MaRDI QIDQ1043967
Bo Tan, Hui Rao, Teturo Kamae, Yu-Mei Xue
Publication date: 10 December 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2009.02.001
Related Items (6)
Three complexity functions ⋮ Partitions by congruent sets and optimal positions ⋮ Maximal pattern complexity, dual system and pattern recognition ⋮ Uniform sets and super-stationary sets over general alphabets ⋮ Behavior of various complexity functions ⋮ Uniform sets and complexity
Cites Work
This page was built for publication: Super-stationary set, subword problem and the complexity
