scholarly journals Strong immersion is a well‐quasi‐ordering for semicomplete digraphs

2018 ◽  
Vol 90 (4) ◽  
pp. 484-496
Author(s):  
Florian Barbero ◽  
Christophe Paul ◽  
Michał Pilipczuk
Keyword(s):  
Quasi Ordering

Well-quasi-ordering hereditarily finite sets

2013 ◽  
Vol 90 (6) ◽  
pp. 1278-1291 ◽  
Author(s):  
Alberto Policriti ◽  
Alexandru I. Tomescu
Keyword(s):  
Finite Sets ◽  
Quasi Ordering

scholarly journals On Well-quasi-ordering Finite Sequences

1989 ◽  
Vol 10 (3) ◽  
pp. 227-230 ◽  
Author(s):  
Ulrich Bollerhoff
Keyword(s):  
Finite Sequences ◽  
Quasi Ordering

On Well-Quasi-Ordering Finite Trees

2009 ◽  
pp. 329-331
Author(s):  
C. ST. J. A. Nash-Williams
Keyword(s):  
Quasi Ordering

scholarly journals A Counterexample Regarding Labelled Well-Quasi-Ordering

2018 ◽  
Vol 34 (6) ◽  
pp. 1395-1409 ◽  
Author(s):  
Robert Brignall ◽  
Michael Engen ◽  
Vincent Vatter
Keyword(s):  
Quasi Ordering

On well-quasi-ordering infinite trees – Nash–Williams's theorem revisited

2001 ◽  
Vol 130 (3) ◽  
pp. 401-408 ◽  
Author(s):  
DANIELA KÜHN
Keyword(s):  
Short Proof ◽  
Infinite Trees ◽  
Quasi Ordering

Nash–Williams proved that the infinite trees are well-quasi-ordered (indeed, better-quasi-ordered) under the topological minor relation. We combine ideas of several authors into a more accessible and essentially self-contained short proof.

scholarly journals Well (and Better) Quasi-Ordered Transition Systems

2010 ◽  
Vol 16 (4) ◽  
pp. 457-515 ◽  
Author(s):  
Parosh Aziz Abdulla
Keyword(s):  
Petri Nets ◽  
Timed Automata ◽  
Timed Petri Nets ◽  
Transition Systems ◽  
State Spaces ◽  
Rewriting Systems ◽  
Symbolic Representations ◽  
Infinite State ◽  
Lossy Channel ◽  
Quasi Ordering

AbstractIn this paper, we give a step by step introduction to the theory ofwell quasi-orderedtransition systems. The framework combines two concepts, namely (i) transition systems which aremonotonicwrt. awell-quasi ordering; and (ii) a scheme for symbolicbackwardreachability analysis. We describe several models with infinite-state spaces, which can be analyzed within the framework, e.g., Petri nets, lossy channel systems, timed automata, timed Petri nets, and multiset rewriting systems. We will also presentbetter quasi-orderedtransition systems which allow the design of efficient symbolic representations of infinite sets of states.

scholarly journals Induced minors and well-quasi-ordering

2019 ◽  
Vol 134 ◽  
pp. 110-142 ◽  
Author(s):  
Jarosław Błasiok ◽  
Marcin Kamiński ◽  
Jean-Florent Raymond ◽  
Théophile Trunck
Keyword(s):  
Quasi Ordering
Sign in / Sign up

Export Citation Format

Share Document