Unavoidable sets of partial words

From MaRDI portal
Revision as of 10:20, 30 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:733729

DOI10.1007/S00224-008-9106-1zbMath1187.68358OpenAlexW2049228167WikidataQ61719047 ScholiaQ61719047MaRDI QIDQ733729

Andy Kalcic, Justin Palumbo, N. C. Brownstein, Tracy Weyand, Francine Blanchet-Sadri

Publication date: 19 October 2009

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: http://libres.uncg.edu/ir/uncg/f/F_Blanchet-Sadri_Unavoidable_2009.pdf




Related Items (9)




Cites Work




This page was built for publication: Unavoidable sets of partial words