Atminas, Aistis, Lozin, Vadim and Moshkov, Mikhail
(2017)
WQO is decidable for factorial languages.
Information and Computation.
ISSN 0890-5401
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.
Actions (login required)
|
View Item |