Deciding WQO for factorial languages

Type
Conference Paper
Authors
Atminas, Aistis
Lozin, Vadim V.
Moshkov, Mikhail cc
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
Date
2013-04-05
Permanent link to this record
http://hdl.handle.net/10754/564707

Metadata
Show full item record
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.
Citation
Atminas, A., Lozin, V., & Moshkov, M. (2013). Deciding WQO for Factorial Languages. Lecture Notes in Computer Science, 68–79. doi:10.1007/978-3-642-37064-9_8
Publisher
Springer Nature
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
ISBN
9783642370632
DOI
10.1007/978-3-642-37064-9_8
10.1007/978-3-642-37064-9-8
Collections
Conference Papers; Applied Mathematics and Computational Science Program; Computer, Electrical and Mathematical Science and Engineering (CEMSE) Division