Pages that link to "Item:Q5674988"
From MaRDI portal
The following pages link to Language identification in the limit (Q5674988):
Displaying 50 items.
- On the role of update constraints and text-types in iterative learning (Q259061) (← links)
- Fast learning of restricted regular expressions and dtds (Q269337) (← links)
- Inferring uniquely terminating regular languages from positive data (Q287033) (← links)
- On inferring linear single-tree languages (Q294705) (← links)
- How rich is the structure of the intrinsic complexity of learning (Q294809) (← links)
- The unexpected applicability of paraconsistent logic: a Chomskyan route to dialetheism (Q301342) (← links)
- Minimal consistent DFA revisited (Q306711) (← links)
- Inductive inference and reverse mathematics (Q324252) (← links)
- A map of update constraints in inductive inference (Q329603) (← links)
- Parallel learning of automatic classes of languages (Q329605) (← links)
- Strongly non-U-shaped language learning results by general techniques (Q342700) (← links)
- Enlarging learnable classes (Q342717) (← links)
- A model of language learning with semantics and meaning-preserving corrections (Q343904) (← links)
- Inferring descriptive generalisations of formal languages (Q355503) (← links)
- Mind change speed-up for learning languages from positive data (Q388110) (← links)
- Four one-shot learners for regular tree languages and their polynomial characterizability (Q388793) (← links)
- Learning and classifying (Q390916) (← links)
- Iterative learning from positive data and counters (Q391750) (← links)
- Fluctuations, effective learnability and metastability in analysis (Q392289) (← links)
- Languages as hyperplanes: grammatical inference with string kernels (Q413838) (← links)
- Learning finite cover automata from queries (Q414872) (← links)
- Iterative learning from texts and counterexamples using additional information (Q415613) (← links)
- Computation as an unbounded process (Q418791) (← links)
- A mathematical model of prediction-driven instability: how social structure can drive language change (Q438586) (← links)
- Learning with ordinal-bounded memory from positive data (Q440010) (← links)
- Polynomial characteristic sets for \(DFA\) identification (Q442107) (← links)
- Categorial grammars with iterated types form a strict hierarchy of \(k\)-valued languages (Q442141) (← links)
- Confident and consistent partial learning of recursive functions (Q465247) (← links)
- Unscrambling the quantum omelette (Q472735) (← links)
- A succinct canonical register automaton model (Q478388) (← links)
- Distributional learning of parallel multiple context-free grammars (Q479454) (← links)
- Learning concepts and their unions from positive data with refinement operators (Q513348) (← links)
- Identification of probabilities (Q514153) (← links)
- Teaching randomized learners with feedback (Q553294) (← links)
- Finite identification from the viewpoint of epistemic update (Q553305) (← links)
- Hypothesis spaces for learning (Q553319) (← links)
- The efficiency of identifying timed automata and the power of clocks (Q553334) (← links)
- Comparison of identification criteria for machine inductive inference (Q585192) (← links)
- Learning all subfunctions of a function (Q596299) (← links)
- Classes with easily learnable subclasses (Q598186) (← links)
- On the classification of recursive languages (Q598240) (← links)
- Learning of event-recording automata (Q604474) (← links)
- Optimal language learning from positive data (Q642522) (← links)
- Anomalous learning helps succinctness (Q671420) (← links)
- Monotonic and dual monotonic language learning (Q672148) (← links)
- A learning-theoretic characterization of classes of recursive functions (Q673668) (← links)
- Language learning without overgeneralization (Q673781) (← links)
- Training digraphs (Q674181) (← links)
- On a question about learning nearly minimal programs (Q674285) (← links)
- Case-based representation and learning of pattern languages (Q674401) (← links)
