Search results for "well-quasi-order"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
34	Robert Bonnet, Matatyahu Rubin	On poset Boolean algebras of scattered posets with finite width.	Arch. Math. Log.	2004	DBLP DOI BibTeX RDF	Poset Boolean algebra, Scattered poset, Well quasi order
34	Reinhard Diestel	Relating Subsets of a Poset, and a Partition Theorem for WQOs.	Order	2001	DBLP DOI BibTeX RDF	WQO, partition, graph minors, well-quasi-order
26	Jean Goubault-Larrecq	On Noetherian Spaces.	LICS	2007	DBLP DOI BibTeX RDF
25	Jacques Duparc, Louis Vuilleumier	The Wadge order on the Scott Domain is not a Well-quasi-order.	J. Symb. Log.	2020	DBLP DOI BibTeX RDF
21	Flavio D'Alessandro, Stefano Varricchio	Well Quasi-orders in Formal Language Theory.	Developments in Language Theory	2008	DBLP DOI BibTeX RDF	iterated shuffle, finite automata, context-free languages, shuffle, Well quasi-orders
21	Robert Brignall	Labelled Well-Quasi-Order in Juxtapositions of Permutation Classes.	Electron. J. Comb.	2024	DBLP DOI BibTeX RDF
21	V. Ironmonger, Nik Ruskuc	Decidability of well quasi-order and atomicity for equivalence relations under embedding orderings.	CoRR	2023	DBLP DOI BibTeX RDF
21	M. McDevitt, Nikola Ruskuc	Atomicity and Well Quasi-Order for Consecutive Orderings on Words and Permutations.	SIAM J. Discret. Math.	2021	DBLP DOI BibTeX RDF
21	Sophie Huczynska, Nikola Ruskuc	On well quasi-order of graph classes under homomorphic image orderings.	Eur. J. Comb.	2017	DBLP DOI BibTeX RDF
21	Aistis Atminas, Robert Brignall, Nicholas Korpelainen, Vadim V. Lozin, Vincent Vatter	Well-Quasi-Order for Permutation Graphs Omitting a Path and a Clique.	Electron. J. Comb.	2015	DBLP DOI BibTeX RDF
21	Sophie Huczynska, Nik Ruskuc	Well quasi-order in combinatorics: embeddings and homomorphisms.	Surveys in Combinatorics	2015	DBLP DOI BibTeX RDF
21	Maria Chudnovsky, Paul D. Seymour	A well-quasi-order for tournaments.	J. Comb. Theory, Ser. B	2011	DBLP DOI BibTeX RDF
21	Jean Daligault, Michaël Rao, Stéphan Thomassé	Well-Quasi-Order of Relabel Functions.	Order	2010	DBLP DOI BibTeX RDF
21	Marko Petkovsek	Letter graphs and well-quasi-order by induced subgraphs.	Discret. Math.	2002	DBLP DOI BibTeX RDF
21	David Haussler	Another generalization of Higman's well quasi order result on Sigma*.	Discret. Math.	1985	DBLP DOI BibTeX RDF
14	Flavio D'Alessandro, Stefano Varricchio	On Well Quasi-orders on Languages.	Developments in Language Theory	2003	DBLP DOI BibTeX RDF
9	Salil Joshi 0002, Barbara König 0001	Applying the Graph Minor Theorem to the Verification of Graph Transformation Systems.	CAV	2008	DBLP DOI BibTeX RDF
8	Flavio D'Alessandro, Gwénaël Richomme, Stefano Varricchio	Well Quasi Orders and the Shuffle Closure of Finite Sets.	Developments in Language Theory	2006	DBLP DOI BibTeX RDF
8	Benedetto Intrigila, Stefano Varricchio	On the Generalization of Higman and Kruskal's Theorems to Regular Languages and Rational Trees.	Acta Informatica	2000	DBLP DOI BibTeX RDF
8	Joël Ouaknine, James Worrell 0001	On the Language Inclusion Problem for Timed Automata: Closing a Decidability Gap.	LICS	2004	DBLP DOI BibTeX RDF
7	Flavio D'Alessandro, Stefano Varricchio	Avoidable Sets and Well Quasi-Orders.	Developments in Language Theory	2004	DBLP DOI BibTeX RDF
7	Walter Bucher, Andrzej Ehrenfeucht, David Haussler	On Total Regulators Generated by Derivation Relations.	ICALP	1985	DBLP DOI BibTeX RDF