Generalized factorizations of words and their algorithmic properties
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3811868 (Why is no real title available?)
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 3639163 (Why is no real title available?)
- scientific article; zbMATH DE number 1988973 (Why is no real title available?)
- A note on decidability questions on presentations of word semigroups
- The expressibility of languages and relations by word equations
- The space complexity of the unique decipherability problem
Cited in
(11)- Positions of the ranks of factors in certain finite long length words
- Generic Algorithms for Factoring Strings
- scientific article; zbMATH DE number 1183242 (Why is no real title available?)
- Analysis of generating functions for special words and numbers and algorithms for computation
- Conditions for the existence of maximal factorizations
- Partition theorems for factorizations of ascending parameter words
- Factorizing words over an ordered alphabet
- A logic for document spanners
- \(\alpha\)-words and factors of characteristic sequences
- Computing equality-free string factorisations
- Coding partitions of regular sets
This page was built for publication: Generalized factorizations of words and their algorithmic properties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1292486)
