학술논문
On the complexity of deciding avoidability of sets of partial words
Document Type
Article
Source
In: Theoretical Computer Science . (Theoretical Computer Science, 5 November 2010, 411(49):4263-4271)
Subject
Language
English
ISSN
03043975