KAUST DepartmentApplied Mathematics and Computational Science Program
Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
Online Publication Date2017-08-08
Print Publication Date2017-10
Permanent link to this recordhttp://hdl.handle.net/10754/625350
MetadataShow full item record
AbstractA language is factorial if it is closed under taking factors, i.e. contiguous subwords. Every factorial language can be described by an antidictionary, i.e. a minimal set of forbidden factors. We show that the problem of deciding whether a factorial language given by a finite antidictionary is well-quasi-ordered under the factor containment relation can be solved in polynomial time. We also discuss possible ways to extend our solution to permutations and graphs.
CitationAtminas A, Lozin V, Moshkov M (2017) WQO is Decidable for Factorial Languages. Information and Computation. Available: http://dx.doi.org/10.1016/j.ic.2017.08.001.
SponsorsThis author gratefully acknowledges support from EPSRC, grant EP/L020408/1. Support of KAUST is gratefully acknowledged.
JournalInformation and Computation