Maps for learning indexable classes
From MaRDI portal
Cites work
- A characterization of non-isometric binary words
- A continuity principle, a version of Baire's theorem and a boundedness principle
- A Machine-Independent Theory of the Complexity of Recursive Functions
- A map of update constraints in inductive inference
- A solution to Wiehagen's thesis
- Asymptotic number of isometric generalized Fibonacci cubes
- Bad pictures: some structural properties related to overlaps
- Cautious limit learning
- Checking whether a word is Hamming-isometric in linear time
- Continuity and nondiscontinuity in constructive mathematics
- Continuity properties in constructive mathematics
- Criteria of language learning
- Dependent choice, `quote' and the clock
- Fun slot machines and transformations of words avoiding factors
- Generalized Fibonacci cubes
- Geometric spaces with no points
- scientific article; zbMATH DE number 3916267 (Why is no real title available?)
- scientific article; zbMATH DE number 3932417 (Why is no real title available?)
- scientific article; zbMATH DE number 3984596 (Why is no real title available?)
- scientific article; zbMATH DE number 3664922 (Why is no real title available?)
- scientific article; zbMATH DE number 42114 (Why is no real title available?)
- scientific article; zbMATH DE number 3539202 (Why is no real title available?)
- scientific article; zbMATH DE number 408780 (Why is no real title available?)
- scientific article; zbMATH DE number 517033 (Why is no real title available?)
- Hypercubes and isometric words based on swap and mismatch distance
- Incremental learning from positive data
- Inductive inference of automata, functions and programs
- Inductive inference of formal languages from positive data
- Isometric words based on swap and mismatch distance
- Jewels of Stringology
- Language identification in the limit
- Language learning from texts: Mindchanges, limited memory and monotonicity
- Learning indexed families of recursive languages from positive data: A survey
- Learning languages with decidable hypotheses
- Learning strategies
- Monotonic and dual monotonic language learning
- Monotonic and non-monotonic inductive inference
- Normal forms in semantic language identification
- On \(k\)-ary \(n\)-cubes and isometric words
- On the Cauchy completeness of the constructive Cauchy reals
- On the failure of BD-ℕ and BD, and an application to the anti-specker property
- On the necessity of some topological spaces
- Optimal language learning from positive data
- Proofs of two conjectures on generalized Fibonacci cubes
- Prudence and other conditions on formal language learning
- Quaternary n-cubes and isometric words
- Results on memory-limited U-shaped learning
- Revolutions and revelations in computability. 18th conference on computability in Europe, CiE 2022, Swansea, UK, July 11--15, 2022. Proceedings
- Separating fragments of WLEM, LPO, and MP
- Separating the fan theorem and its weakenings
- Separating the fan theorem and its weakenings. II
- Set-driven and rearrangement-independent learning of recursive languages
- Strongly non-U-shaped language learning results by general techniques
- Structure of Fibonacci cubes: a survey
- Systems that learn. An introduction to learning theory for cognitive and computer scientists
- The structures of bad words
- Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE
- Toward a mathematical theory of inductive inference
- Towards an atlas of computational learning theory
- Typed lambda-calculus in classical Zermelo-Fraenkel set theory
- U-shaped, iterative, and iterative-with-counter learning
- When unlearning helps
This page was built for publication: Maps for learning indexable classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7020825)
