On the public citation graph

Language Learning from Texts: Degrees of Intrinsic Complexity and Their Characterizations

https://doi.org/10.1006/jcss.2001.1759

0 signed · 45 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.

Claim with ORCID

Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1006/inco.1995.1158openalex-snapshot

On the Intrinsic Complexity of Learning

inferredcites →https://doi.org/10.1006/inco.1995.1170openalex-snapshot

Language Learning from Texts: Mindchanges, Limited Memory, and Monotonicity

inferredcites →https://doi.org/10.1006/jcss.1996.0030openalex-snapshot

The Intrinsic Complexity of Language Identification

inferredcites →https://doi.org/10.1007/3-540-58520-6_79openalex-snapshot

Monotonicity versus efficiency for learning languages from texts

inferredcites →https://doi.org/10.1007/bfb0012761openalex-snapshot

Machine inductive inference and language identification

inferredcites →https://doi.org/10.1007/bfb0019352openalex-snapshot

Baltic Computer Science

inferredcites →https://doi.org/10.1007/bfb0019357openalex-snapshot

Inductive inference of recursive functions: Qualitative theory

inferredcites →https://doi.org/10.1016/0096-0551(80)90011-9openalex-snapshot

Introduction to automata theory, languages, and computation

inferredcites →https://doi.org/10.1016/0304-3975(83)90061-0openalex-snapshot

Comparison of identification criteria for machine inductive inference

inferredcites →https://doi.org/10.1016/0378-4754(79)90040-5openalex-snapshot

An introduction to the general theory of algorithms

inferredcites →https://doi.org/10.1016/0378-4754(81)90068-9openalex-snapshot

Introduction to automata theory, languages and computation

inferredcites →https://doi.org/10.1016/0890-5401(90)90042-gopenalex-snapshot

Prudence and other conditions on formal language learning

inferredcites →https://doi.org/10.1016/s0019-9958(67)91165-5openalex-snapshot

Language identification in the limit

inferredcites →https://doi.org/10.1016/s0019-9958(72)90424-xopenalex-snapshot

Some decidability results on grammatical inference and complexity

inferredcites →https://doi.org/10.1016/s0019-9958(75)90261-2openalex-snapshot

Toward a mathematical theory of inductive inference

inferredcites →https://doi.org/10.1016/s0019-9958(82)80025-9openalex-snapshot

Criteria of language learning

inferredcites →https://doi.org/10.1016/s0019-9958(86)80042-0openalex-snapshot

On the complexity of inductive inference

inferredcites →https://doi.org/10.1016/s0022-0000(05)80088-1openalex-snapshot

Characterizing language identification by standardizing operations

inferredcites →https://doi.org/10.1093/comjnl/12.1.28openalex-snapshot

Theory of Recursive Functions and Effective Computability

inferredcites →https://doi.org/10.1142/s0129054193000110openalex-snapshot

LEARNING RECURSIVE LANGUAGES WITH BOUNDED MIND CHANGES

inferredcites →https://doi.org/10.1145/307400openalex-snapshot

Proceedings of the twelfth annual conference on Computational learning theory

inferredcites →https://doi.org/10.1145/307400.307465openalex-snapshot

On the intrinsic complexity of learning recursive functions

inferredcites →https://doi.org/10.1145/321386.321395openalex-snapshot

A Machine-Independent Theory of the Complexity of Recursive Functions

inferredcites →https://doi.org/10.2307/2275636openalex-snapshot

The structure of intrinsic complexity of learning

inferredcites →https://doi.org/10.2307/2316720openalex-snapshot

Theory of Recursive Functions and Effective Computability.

inferredcites →https://doi.org/10.5555/93025.93081openalex-snapshot

The power of vacillation

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11503415_27openalex-snapshot

Mind Change Efficient Learning

inferred← citeshttps://doi.org/10.1007/3-540-44581-1_12openalex-snapshot

Intrinsic Complexity of Learning Geometrical Concepts from Positive Data

inferred← citeshttps://doi.org/10.1007/3-540-45583-3_19openalex-snapshot

Learning Languages in a Union

inferred← citeshttps://doi.org/10.1007/978-0-387-30164-8_149openalex-snapshot

Complexity of Inductive Inference

inferred← citeshttps://doi.org/10.1007/978-1-4899-7502-7_46-1openalex-snapshot

Complexity of Inductive Inference

inferred← citeshttps://doi.org/10.1007/978-1-4899-7687-1_46openalex-snapshot

Complexity of Inductive Inference

inferred← citeshttps://doi.org/10.1007/978-3-319-46379-7_12openalex-snapshot

Intrinsic Complexity of Partial Learning

inferred← citeshttps://doi.org/10.1007/978-3-540-39624-6_6openalex-snapshot

Intrinsic Complexity of Uniform Learning

inferred← citeshttps://doi.org/10.1007/978-3-540-72927-3_17openalex-snapshot

Mitotic Classes

inferred← citeshttps://doi.org/10.1007/978-3-540-87987-9_31openalex-snapshot

Topological Properties of Concept Spaces

inferred← citeshttps://doi.org/10.1007/978-3-642-15488-1_10openalex-snapshot

Splitting of Learnable Classes

inferred← citeshttps://doi.org/10.1016/j.ic.2006.02.004openalex-snapshot

Mind change efficient learning

inferred← citeshttps://doi.org/10.1016/j.ic.2009.08.001openalex-snapshot

Topological properties of concept spaces (full version)

inferred← citeshttps://doi.org/10.1016/j.jcss.2006.01.005openalex-snapshot

Learning languages in a union

inferred← citeshttps://doi.org/10.1016/j.tcs.2006.07.040openalex-snapshot

An approach to intrinsic complexity of uniform learning

inferred← citeshttps://doi.org/10.1016/j.tcs.2008.02.030openalex-snapshot

Learning indexed families of recursive languages from positive data: A survey

inferred← citeshttps://doi.org/10.1016/j.tcs.2018.12.022openalex-snapshot

Intrinsic complexity of partial learning

inferred← citeshttps://doi.org/10.1016/s0022-0000(03)00067-9openalex-snapshot

Intrinsic complexity of learning geometrical concepts from positive data

inferred← citeshttps://doi.org/10.1137/070700577openalex-snapshot

Mitotic Classes in Inductive Inference

Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.