WQO is Decidable for Factorial Languages

Handle URI:
http://hdl.handle.net/10754/625350
Title:
WQO is Decidable for Factorial Languages
Authors:
Atminas, Aistis; Lozin, Vadim; Moshkov, Mikhail ( 0000-0003-0085-9483 )
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.
KAUST Department:
Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
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.
Publisher:
Elsevier BV
Journal:
Information and Computation
Issue Date:
8-Aug-2017
DOI:
10.1016/j.ic.2017.08.001
Type:
Article
ISSN:
0890-5401
Sponsors:
This author gratefully acknowledges support from EPSRC, grant EP/L020408/1. Support of KAUST is gratefully acknowledged.
Additional Links:
http://www.sciencedirect.com/science/article/pii/S0890540117301396
Appears in Collections:
Articles; Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division

Full metadata record

DC FieldValue Language
dc.contributor.authorAtminas, Aistisen
dc.contributor.authorLozin, Vadimen
dc.contributor.authorMoshkov, Mikhailen
dc.date.accessioned2017-08-14T06:41:39Z-
dc.date.available2017-08-14T06:41:39Z-
dc.date.issued2017-08-08en
dc.identifier.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.en
dc.identifier.issn0890-5401en
dc.identifier.doi10.1016/j.ic.2017.08.001en
dc.identifier.urihttp://hdl.handle.net/10754/625350-
dc.description.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.en
dc.description.sponsorshipThis author gratefully acknowledges support from EPSRC, grant EP/L020408/1. Support of KAUST is gratefully acknowledged.en
dc.publisherElsevier BVen
dc.relation.urlhttp://www.sciencedirect.com/science/article/pii/S0890540117301396en
dc.rightsNOTICE: this is the author’s version of a work that was accepted for publication in Information and Computation. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Information and Computation, 8 August 2017. DOI: 10.1016/j.ic.2017.08.001. © 2017. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/en
dc.subjectWell-quasi-orderingen
dc.subjectFactorial languageen
dc.subjectPolynomial-time algorithmen
dc.subjectInduced subgraphen
dc.subjectPermutationen
dc.titleWQO is Decidable for Factorial Languagesen
dc.typeArticleen
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Divisionen
dc.identifier.journalInformation and Computationen
dc.eprint.versionPost-printen
dc.contributor.institutionDepartment of Mathematics, London School of Economics, Houghton Street, London WC2A 2AE, UKen
dc.contributor.institutionMathematics Institute, University of Warwick, Coventry, CV4 7AL, UKen
kaust.authorMoshkov, Mikhailen
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.