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

Preview

Text - Accepted Version Download (435kB) | Preview

• Publisher

Abstract

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:	https://www.journals.elsevier.com/information-and-...
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:	06 Apr 2024 03:30
URI:	http://eprints.lse.ac.uk/id/eprint/84044

Actions (login required)

View Item