Name:
1-s2.0-S0890540117301396-main.pdf
Size:
338.1Kb
Format:
PDF
Description:
Accepted Manuscript
Embargo End Date:
2019-08-08
Type
ArticleDate
2017-08-08Permanent link to this record
http://hdl.handle.net/10754/625350
Metadata
Show full item recordAbstract
A 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.Citation
Atminas 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.Sponsors
This author gratefully acknowledges support from EPSRC, grant EP/L020408/1. Support of KAUST is gratefully acknowledged.Publisher
Elsevier BVJournal
Information and ComputationISSN
0890-5401Additional Links
http://www.sciencedirect.com/science/article/pii/S0890540117301396ae974a485f413a2113503eed53cd6c53
10.1016/j.ic.2017.08.001