✦ LIBER ✦

On well-quasi-ordering finite structures with labels

✍ Scribed by Igor Kříž; Robin Thomas

Book ID: 105309122
Publisher: Springer Japan
Year: 1990
Tongue: English
Weight: 669 KB
Volume: 6
Category: Article
ISSN: 0911-0119
DOI: 10.1007/bf01787479

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On well-quasi-ordering-finite graphs by

On well-quasi-ordering-finite graphs by immersion

✍ Thomas Andreae 📂 Article 📅 1986 🏛 Springer-Verlag 🌐 English ⚖ 698 KB

Well Quasi Ordering Finite Posets and Fo

Well Quasi Ordering Finite Posets and Formal Languages

✍ J. Gustedt 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 504 KB

Algorithmic Analysis of Programs with We

Algorithmic Analysis of Programs with Well Quasi-ordered Domains

✍ Parosh Aziz Abdulla; Kārlis Čerāns; Bengt Jonsson; Yih-Kuen Tsay 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 180 KB

Preservation under Extensions on Well-Be

Preservation under Extensions on Well-Behaved Finite Structures

✍ Atserias, Albert; Dawar, Anuj; Grohe, Martin 📂 Article 📅 2008 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 229 KB

Orthogonal structures on finite partial

Orthogonal structures on finite partial orders

✍ David Lubell 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 383 KB

Another generalization of Higman's well

Another generalization of Higman's well quasi order result on Σ∗

✍ David Haussler 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 413 KB

We present another generalization of Higman's result ([2]) that the subsequence embedding relationship on a finitely generated free monoid is a well quasi order. Our result is analogous to the generalization of Higman's result given in in the following manner. In the quasi orders we consider, we ar