Deciding representability of sets of words of equal length

DOI10.1016/J.TCS.2012.12.042zbMath1293.68158OpenAlexW2086208278MaRDI QIDQ1939274

Sean Simmons, Francine Blanchet-Sadri

Publication date: 4 March 2013

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.12.042

zbMATH Keywords

representable setfactorsubwordpartial wordcomplexity classes P and NP

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics on words (68R15)

Related Items (3)

Computing generalized de Bruijn sequences ⋮ Computing Minimum Length Representations of Sets of Words of Uniform Length ⋮ Computing minimum length representations of sets of words of uniform length

This page was built for publication: Deciding representability of sets of words of equal length