Using unavoidable set of trees to generalize Kruskal's theorem
Journal of Symbolic Computation
On the regularity of languages on a binary alphabet generated by copying systems
Information Processing Letters
Well quasi-orders and regular languages
Acta Informatica
On quasi orders of words and the confluence property
Theoretical Computer Science
On well quasi orders of free monoids
Theoretical Computer Science - Special issue: papers dedicated to the memory of Marcel-Paul Schützenberger
Shuffle and scattered deletion closure of languages
Theoretical Computer Science
Finiteness and Regularity in Semigroups and Formal Languages
Finiteness and Regularity in Semigroups and Formal Languages
Some Regularity Conditions Based on Well Quasi-Orders
LATIN '92 Proceedings of the 1st Latin American Symposium on Theoretical Informatics
Well quasi-orders and context-free grammars
Theoretical Computer Science - Developments in language theory
Applied Combinatorics on Words (Encyclopedia of Mathematics and its Applications)
Applied Combinatorics on Words (Encyclopedia of Mathematics and its Applications)
Regular solutions of language inequalities and well quasi-orders
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
On well quasi-orders on languages
DLT'03 Proceedings of the 7th international conference on Developments in language theory
The power of commuting with finite sets of words
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Avoidable sets and well quasi-orders
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Well quasi orders and the shuffle closure of finite sets
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
| Hi-index | 0.00 |
The concept of well quasi-order is a generalization of the classical notion of well order and plays a role in the studying of several problems of Mathematics and Theoretical Computer Science. This paper concerns some applications of well quasi-orders to Formal Language Theory. In particular, we present a survey of classical and recent results, based upon such structures, concerning context-free and regular languages. We also focus our attention to some application of well quasi-orders in the studying of languages obtained by using the operators of shuffle and iterated shuffle of finite languages.