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.
| Original language | English |
|---|---|
| Title of host publication | Language and Automata Theory and Applications - 7th International Conference, LATA 2013, Proceedings |
| Publisher | Springer Verlag |
| Pages | 68-79 |
| Number of pages | 12 |
| ISBN (Print) | 9783642370632 |
| DOIs | |
| Publication status | Published - 2013 |
| Externally published | Yes |
| Event | 7th International Conference on Language and Automata Theory and Applications, LATA 2013 - Bilbao, Spain Duration: 2 Apr 2013 → 5 Apr 2013 |
Publication series
| Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Volume | 7810 LNCS |
| ISSN (Print) | 0302-9743 |
| ISSN (Electronic) | 1611-3349 |
Conference
| Conference | 7th International Conference on Language and Automata Theory and Applications, LATA 2013 |
|---|---|
| Country/Territory | Spain |
| City | Bilbao |
| Period | 2/04/13 → 5/04/13 |
Keywords
- factorial language
- polynomial-time algorithm
- well-quasi-ordering
Cite this
Atminas, A., Lozin, V., & Moshkov, M. (2013). Deciding WQO for factorial languages. In Language and Automata Theory and Applications - 7th International Conference, LATA 2013, Proceedings (pp. 68-79). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7810 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-642-37064-9_8