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 STYLE
Atminas, A., Lozin, V., & Moshkov, M. (2013). Deciding WQO for factorial languages. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7810 LNCS, pp. 68–79). Springer Verlag. https://doi.org/10.1007/978-3-642-37064-9_8
Mendeley helps you to discover research relevant for your work.