Linear-time version of Holub's algorithm for morphic imprimitivity testing
From MaRDI portal
(Redirected from Publication:497670)
Recommendations
Cites work
- scientific article; zbMATH DE number 3940748 (Why is no real title available?)
- A fast algorithm for solving systems of linear equations with two variables per equation
- Algorithms on Strings
- Complexity of testing morphic primitivity
- Fast Algorithms for Finding Nearest Common Ancestors
- Finding a homomorphism between two words is NP-complete
- Fixed languages and the adult languages of ol schemest†
- Linear-Time Version of Holub’s Algorithm for Morphic Imprimitivity Testing
- Morphically primitive words
- Polynomial-time algorithm for fixed points of nontrivial morphisms
Cited in
(7)- Polynomial-time algorithm for fixed points of nontrivial morphisms
- The Billaud conjecture for \(|\varSigma| = 4\), and beyond
- Complexity of testing morphic primitivity
- Crochemore's partitioning on weighted strings and applications
- Linear-Time Version of Holub’s Algorithm for Morphic Imprimitivity Testing
- On Billaud words and their companions
- On Billaud words and their companions
This page was built for publication: Linear-time version of Holub's algorithm for morphic imprimitivity testing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q497670)