Deciding WQO for factorial languages

Handle URI:
http://hdl.handle.net/10754/564707
Title:
Deciding WQO for factorial languages
Authors:
Atminas, Aistis; Lozin, Vadim V.; 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. © 2013 Springer-Verlag Berlin Heidelberg.
KAUST Department:
Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division; Applied Mathematics and Computational Science Program; Extensions of Dynamic Programming, Machine Learning and Discrete Optimization Research Group
Publisher:
Springer Verlag
Journal:
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Conference/Event name:
7th International Conference on Language and Automata Theory and Applications, LATA 2013
Issue Date:
5-Apr-2013
DOI:
10.1007/978-3-642-37064-9-8
Type:
Conference Paper
ISSN:
03029743
ISBN:
9783642370632
Appears in Collections:
Conference Papers; Applied Mathematics and Computational Science Program; Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division

Full metadata record

DC FieldValue Language
dc.contributor.authorAtminas, Aistisen
dc.contributor.authorLozin, Vadim V.en
dc.contributor.authorMoshkov, Mikhailen
dc.date.accessioned2015-08-04T07:13:11Zen
dc.date.available2015-08-04T07:13:11Zen
dc.date.issued2013-04-05en
dc.identifier.isbn9783642370632en
dc.identifier.issn03029743en
dc.identifier.doi10.1007/978-3-642-37064-9-8en
dc.identifier.urihttp://hdl.handle.net/10754/564707en
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. © 2013 Springer-Verlag Berlin Heidelberg.en
dc.publisherSpringer Verlagen
dc.subjectfactorial languageen
dc.subjectpolynomial-time algorithmen
dc.subjectwell-quasi-orderingen
dc.titleDeciding WQO for factorial languagesen
dc.typeConference Paperen
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Divisionen
dc.contributor.departmentApplied Mathematics and Computational Science Programen
dc.contributor.departmentExtensions of Dynamic Programming, Machine Learning and Discrete Optimization Research Groupen
dc.identifier.journalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)en
dc.conference.date2 April 2013 through 5 April 2013en
dc.conference.name7th International Conference on Language and Automata Theory and Applications, LATA 2013en
dc.conference.locationBilbaoen
dc.contributor.institutionDIMAP, Mathematics Institute, University of Warwick, Coventry CV4 7AL, United Kingdomen
kaust.authorMoshkov, Mikhailen
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.