Library Header Image
LSE Research Online LSE Library Services

WQO is decidable for factorial languages

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

Text - Accepted Version
Download (435kB) | Preview

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.
Divisions: Mathematics
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Date Deposited: 18 Aug 2017 13:11
Last Modified: 15 May 2024 19:42

Actions (login required)

View Item View Item


Downloads per month over past year

View more statistics