The Library
WQO is decidable for factorial languages
Tools
Tools
Tools
Atminas, Aistis, Lozin, Vadim V. and Moshkov, M. (2017) WQO is decidable for factorial languages. Information and Computation, 256 . pp. 321-333. doi:10.1016/j.ic.2017.08.001
|
PDF
WRAP-WQO-decidable-factorial-languages-Lozin-2017.pdf - Accepted Version - Requires a PDF viewer. Available under License Creative Commons Attribution Non-commercial No Derivatives 4.0. Download (644Kb) | Preview |
Official URL: https://doi.org/10.1016/j.ic.2017.08.001
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.
| Item Type: | Journal Article | ||||||||
|---|---|---|---|---|---|---|---|---|---|
| Subjects: | Q Science > QA Mathematics | ||||||||
| Divisions: | Faculty of Science > Mathematics | ||||||||
| Journal or Publication Title: | Information and Computation | ||||||||
| Publisher: | Academic Press | ||||||||
| ISSN: | 0890-5401 | ||||||||
| Official Date: | October 2017 | ||||||||
| Dates: |
|
||||||||
| Volume: | 256 | ||||||||
| Page Range: | pp. 321-333 | ||||||||
| DOI: | 10.1016/j.ic.2017.08.001 | ||||||||
| Status: | Peer Reviewed | ||||||||
| Publication Status: | Published | ||||||||
| Access rights to Published version: | Restricted or Subscription Access |
Request changes or add full text files to a record
Repository staff actions (login required)
 |
View Item |
Downloads
Downloads per month over past year
