An aperiodicity problem for multiwords
From MaRDI portal
Recommendations
Cites work
- A fast string searching algorithm
- A new approach to pattern matching in degenerate DNA/RNA sequences and distributed pattern matching
- Algorithms on Strings
- Efficient string matching
- Fast Pattern Matching in Strings
- Fast pattern-matching on indeterminate strings
- scientific article; zbMATH DE number 4028925 (Why is no real title available?)
- scientific article; zbMATH DE number 3471577 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 1024080 (Why is no real title available?)
- scientific article; zbMATH DE number 801745 (Why is no real title available?)
- scientific article; zbMATH DE number 3368555 (Why is no real title available?)
- On finite monoids having only trivial subgroups
- Partial words and a theorem of Fine and Wilf
- Relational codes of words
- Uniqueness Theorems for Periodic Functions
This page was built for publication: An aperiodicity problem for multiwords
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2911425)