Set systems: order types, continuous nondeterministic deformations, and quasi-orders
From MaRDI portal
Publication:653312
DOI10.1016/J.TCS.2011.08.010zbMATH Open1235.68090arXiv1112.2801OpenAlexW2962706254MaRDI QIDQ653312FDOQ653312
Authors: Yohji Akama 
Publication date: 9 January 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Abstract: By reformulating a learning process of a set system L as a game between Teacher (presenter of data) and Learner (updater of the abstract independent set), we define the order type dim L of L to be the order type of the game tree. The theory of this new order type and continuous, monotone function between set systems corresponds to the theory of well quasi-orderings (WQOs). As Nash-Williams developed the theory of WQOs to the theory of better quasi-orderings (BQOs), we introduce a set system that has order type and corresponds to a BQO. We prove that the class of set systems corresponding to BQOs is closed by any monotone function. In (Shinohara and Arimura. "Inductive inference of unbounded unions of pattern languages from positive data." Theoretical Computer Science, pp. 191-209, 2000), for any set system L, they considered the class of arbitrary (finite) unions of members of L. From viewpoint of WQOs and BQOs, we characterize the set systems L such that the class of arbitrary (finite) unions of members of L has order type. The characterization shows that the order structure of the set system L with respect to the set-inclusion is not important for the resulting set system having order type. We point out continuous, monotone function of set systems is similar to positive reduction to Jockusch-Owings' weakly semirecursive sets.
Full work available at URL: https://arxiv.org/abs/1112.2801
Recommendations
Computational learning theory (68Q32) Combinatorics in computer science (68R05) Applications of game theory (91A80)
Cites Work
- Title not available (Why is that?)
- Elements of automata theory. Translated from the French by Reuben Thomas
- Title not available (Why is that?)
- Title not available (Why is that?)
- Subsystems of second order arithmetic
- Title not available (Why is that?)
- Title not available (Why is that?)
- Learning indexed families of recursive languages from positive data: A survey
- Title not available (Why is that?)
- Title not available (Why is that?)
- Developments from enquiries into the learnability of the pattern languages from positive data
- Reverse mathematics and the equivalence of definitions for well and better quasi-orders
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Classical recursion theory. Vol. II
- Mind change complexity of inferring unbounded unions of restricted pattern languages from positive data
- The theory of well-quasi-ordering: a frequently discovered concept
- Title not available (Why is that?)
- Topological properties of concept spaces (full version)
- Title not available (Why is that?)
- Ordering by Divisibility in Abstract Algebras
- Algebraic Theory of Automata and Languages
- Ordinal mind change complexity of language identification
- Title not available (Why is that?)
- Mind change efficient learning
- From wqo to bqo, via Ellentuck's theorem
- Logic, language and computation. Festschrift in Honor of Satoru Takasu
- Commutative Regular Shuffle Closed Languages, Noetherian Property, and Learning Theory
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (2)
This page was built for publication: Set systems: order types, continuous nondeterministic deformations, and quasi-orders
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q653312)
