WQO is decidable for factorial languages

被引：2

作者：

Atminas, Aistis ^{[1
]}

Lozin, Vadim ^{[2
]}

Moshkov, Mikhail ^{[3
]}

机构：

[1] London Sch Econ, Dept Math, Houghton St, London WC2A 2AE, England

[2] Univ Warwick, Math Inst, Coventry CV4 7AL, W Midlands, England

[3] KAUST, CEMSE Div, Thuwal 239556900, Saudi Arabia

来源：

INFORMATION AND COMPUTATION | 2017年 / 256卷

基金：

英国工程与自然科学研究理事会;

关键词：

Well-quasi-ordering; Factorial language; Polynomial-time algorithm; Induced subgraph; Permutation; INDUCED SUBGRAPHS; QUASI-ORDERS; WELL; PERMUTATIONS; ANTICHAINS;

D O I：

10.1016/j.ic.2017.08.001

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

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. (C) 2017 Elsevier Inc. All rights reserved.

引用

页码：321 / 333

页数：13

共 50 条

[1] Decidable hierarchies of starfree languages
Glasser, C
Schmitz, H
[J]. FST TCS 2000: FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE, PROCEEDINGS, 2000, 1974 : 503 - 515
[2] Learning Languages with Decidable Hypotheses
Berger, Julian
Bother, Maximilian
Doskoc, Vanja
Harder, Jonathan Gadea
Klodt, Nicolas
Kotzing, Timo
Lotzsch, Winfried
Peters, Jannik
Schiller, Leon
Seifert, Lars
Wells, Armin
Wietheger, Simon
[J]. CONNECTING WITH COMPUTABILITY, 2021, 12813 : 25 - 37
[3] Decidable Logic in the Design of Functional Languages
Huang, Hao
Long, Huan
[J]. PROCEEDINGS OF 2012 2ND INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND NETWORK TECHNOLOGY (ICCSNT 2012), 2012, : 261 - 265
[4] THE EQUIVALENCE PROBLEM FOR NTS LANGUAGES IS DECIDABLE
SENIZERGUES, G
[J]. LECTURE NOTES IN COMPUTER SCIENCE, 1982, 145 : 313 - 323
[5] ADHERENCE EQUIVALENCE IS DECIDABLE FOR DOL LANGUAGES
HEAD, T
[J]. LECTURE NOTES IN COMPUTER SCIENCE, 1984, 166 : 241 - 249
[6] On intermediate factorial languages
Shur, Arseny M.
[J]. DISCRETE APPLIED MATHEMATICS, 2009, 157 (07) : 1669 - 1675
[7] The finiteness of synchronous, tabled picture languages is decidable
Truthe, Bianca
[J]. THEORETICAL COMPUTER SCIENCE, 2006, 366 (03) : 297 - 315
[8] A predicative and decidable characterization of the polynomial classes of languages
Caporaso, S
Zito, M
Galesi, N
[J]. THEORETICAL COMPUTER SCIENCE, 2001, 250 (1-2) : 83 - 99
[9] A Decidable Characterization of Locally Testable Tree Languages
Place, Thomas
Segoufin, Luc
[J]. AUTOMATA, LANGUAGES AND PROGRAMMING, PT II, PROCEEDINGS, 2009, 5556 : 285 - +
[10] A DECIDABLE CHARACTERIZATION OF LOCALLY TESTABLE TREE LANGUAGES
Place, Thomas
Segoufin, Luc
[J]. LOGICAL METHODS IN COMPUTER SCIENCE, 2011, 7 (04) : 10 - 25

← 1 2 3 4 5 →