LINK [1] P. A. Abdulla and A. Nylén. “Better is better than well: on efficient verification ofinfinite-state systems,” In 15th Annual IEEE Symposium on Logic in Computer Science (Santa Barbara, CA, 2000), pp. 132-140. IEEE Comput. Soc.Press, Los Alamitos, CA, 2000.

LINK [2] P. A. Abdulla and A. Nylén. Timed Petri nets and BQOs. In Applications and theory of Petri nets 2001, vol. 2075 of Lecture Notes in Computer Science, pp. 53-70. Springer, Berlin, 2001.

LINK [3] Y. Akama. “Set systems: Order types, continuous nondeterministic deformations,and quasi-orders,” Theor. Comput. Sci., vol. 412, no. 45, pp. 6235-6251, 2011.

LINK [4] B. Berard. “Literal shuffle,” Theor. Comput. Sci., vol. 51, pp. 281-299, 1987.

LINK [5] B. Bollobás. Combinatorics. Cambridge University Press, Cambridge, 1986. Set systems, hypergraphs, families of vectors and combinatorialprobability.

LINK [6] D. P. Bovet and S. Varricchio. “On the regularity of languages on a binary alphabet generated bycopying systems,” Inform. Process. Lett., vol. 44, no. 3, pp. 119-123, 1992.

LINK [7] F. D'Alessandro and S. Varricchio. “Well quasi-orders in formal language theory,” In M. Ito and M. Toyama, Ed., Developments in Language Theory, vol. 5257 of Lecture Notes in Computer Science,pp. 84-95. Springer Berlin / Heidelberg, 2008.

LINK [8] M. de Brecht, 2012. Private communication.

LINK [9] M. de Brecht. Topological and Algebraic Aspects of Algorithmic Learning Theory. PhD thesis, Graduate School of Informatics, Kyoto University, 2009.

LINK [10] M. de Brecht and A. Yamamoto. “Mind change complexity of inferring unbounded unions of restrictedpattern languages from positive data,” Theor. Comput. Sci., vol. 411, no. 7-9, pp. 976-985, 2010.

LINK [11] P. de Groote, B. Guillaume, and S. Salvati. “Vector addition tree automata,” In 19th Annual IEEE Symposium on Logic in Computer Science, pp. 64-73, Washington, DC, USA, 2004. IEEE Comput.Soc.

LINK [12] D. H. J. de Jongh and R. Parikh. “Well-partial orderings and hierarchies,” Nederl. Akad. Wetensch. Proc. Ser. A 80=Indag. Math.,vol. 39, no. 3, pp. 195-207, 1977.

LINK [13] R. Diestel. Graph theory, vol. 173 of Graduate Texts in Mathematics. Springer, Heidelberg, fourth edition, 2010.

LINK [14] A. Ehrenfeucht, D. Haussler, and G. Rozenberg. “On regularity of context-free languages,” Theor. Comput. Sci., vol. 27, no. 3, pp. 311-332, 1983.

LINK [15] R. L. Graham, B. L. Rothschild, and J. H. Spencer. Ramsey theory. Wiley-Interscience Series in Discrete Mathematics. John Wiley & Sons, Inc., New York, 2nd edition, 1980. A Wiley-Interscience Publication.

LINK [16] G. Higman. “Ordering by divisibility in abstract algebras,” Proc. London Math. Soc. (3), vol. 2, pp. 326-336, 1952.

LINK [17] M. Ito. Algebraic theory of automata and languages. River Edge, NJ, World Scientific Publishing Co. Inc., 2004.

LINK [18] P. Jancar. “A note on well quasi-orderings for powersets,” Inform. Process. Lett., vol. 72, no. 5-6, pp. 155-160, 1999.

LINK [19] C. G. Jockusch, Jr. “Semirecursive sets and positive reducibility,” Trans. Amer. Math. Soc., vol. 131, pp. 420-436, 1968.

LINK [20] C. G. Jockusch, Jr. and J. C. Owings, Jr. “Weakly semirecursive sets,” J. Symbolic Logic, vol. 55, no. 2, pp. 637-644, 1990.

LINK [21] S. Jukna. Extremal combinatorics. Texts in Theoretical Computer Science. An EATCS Series.Springer-Verlag, Berlin, 2001. With applications in computer science.

LINK [22] M. Kanazawa. Learnable Classes of Categorial Grammars. Studies in Logic, Language and Information. Stanford, CA, CSLI Publications,1998.

LINK [23] J. B. Kruskal. “Well-quasi-ordering, the Tree Theorem, and Vazsonyi'sconjecture,” Trans. Amer. Math. Soc., vol. 95, pp. 210-225, 1960.

LINK [24] D. Kühn. “On well-quasi-ordering infinite trees—Nash-Williams's theoremrevisited,” Math. Proc. Cambridge Philos. Soc., vol. 130, no. 3, pp. 401-408, 2001.

LINK [25] M. Kummer and F. Stephan. “Weakly semirecursive sets and r.e. orderings,” Ann. Pure Appl. Logic, vol. 60, no. 2, pp. 133-150, 1993.

LINK [26] S. Lange, T. Zeugmann, and S. Zilles. “Learning indexed families of recursive languages from positive data:A survey,” Theor. Comput. Sci., vol. 397, no. 1-3, pp. 194-232, 2008. Forty Years of Inductive Inference: Dedicated to the 60th Birthdayof Rolf Wiehagen.

LINK [27] A. Marcone. “Foundations of BQO theory,” Trans. Amer. Math. Soc., vol. 345, no. 2, pp. 641-660, 1994.

LINK [28] A. Marcone. “Fine analysis of the quasi-orderings on the power set,” Order, vol. 18, no. 4, pp. 339-347 (2002), 2001.

LINK [29] T. Motoki, T. Shinohara, and K. Wright. “The correct definition of finite elasticity: corrigendum toidentification of unions,” In COLT '91: Proceedings of the fourth annual workshop on Computational learning theory, p. 375, San Francisco, CA, USA,Morgan Kaufmann Publishers Inc., 1991.

LINK [30] C. St. J. A. Nash-Williams. On well-quasi-ordering infinite trees. Proc. Cambridge Philos. Soc., vol. 61, pp. 697-720, 1965.

LINK [31] C. St. J. A. Nash-Williams. “On better-quasi-ordering transfinite sequences,” Proc. Cambridge Philos. Soc., vol. 64, pp. 273-290, 1968.

LINK [32] M. Ogawa. “Well-quasi-orders and regular ω-languages,” Theor. Comput. Sci., vol. 324, no. 1, pp. 55-60, 2004.

LINK [33] R. Rado. “Partial well-ordering of sets of vectors,” Mathematika, vol. 1, pp. 89-95, 1954.

LINK [34] C. Reutenauer. Free Lie algebras, vol. 7 of London Mathematical Society Monographs. New Series. New York, The Clarendon Press Oxford University Press, 1993. Oxford Science Publications.

LINK [35] N. Robertson and P. Seymour. “Graph minors XXIII. Nash-Williams' immersion conjecture,” J. Combin. Theory Ser. B, vol. 100, no. 2, pp. 181-205, 2010.

LINK [36] G. Rozenberg and A. Salomaa, Ed. Handbook of formal languages, vol. 3: beyond words, NewYork, NY, USA, Springer-Verlag New York, Inc., 1997.

LINK [37] J. Sakarovitch. Elements of automata theory. Cambridge University Press, Cambridge, 2009. Translated from the 2003 French original by Reuben Thomas.

LINK [38] T. Shinohara and H. Arimura. “Inductive inference of unbounded unions of pattern languages frompositive data,” Theor. Comput. Sci., vol. 241, pp. 191-209, 2000.

LINK [39] K. Wright. Identification of unions of languages drawn from an identifiableclass. In COLT '89: Proceedings of the second annual workshop on Computational learning theory, pp. 328-333, San Francisco, CA, USA, 1989.Morgan Kaufmann Publishers Inc.