Library Header Image
LSE Research Online LSE Library Services

WQO is decidable for factorial languages

Atminas, Aistis and Lozin, Vadim and Moshkov, Mikhail (2017) WQO is decidable for factorial languages. Information and Computation. ISSN 0890-5401

[img] Text - Accepted Version
Restricted to Repository staff only until 8 August 2018.

Download (435kB) | Request a copy

Identification Number: 10.1016/j.ic.2017.08.001


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.

Item Type: Article
Official URL:
Additional Information: © 2017 Elsevier Inc.
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Sets: Departments > Mathematics
Date Deposited: 18 Aug 2017 13:11
Last Modified: 30 Aug 2017 12:45

Actions (login required)

View Item View Item


Downloads per month over past year

View more statistics