Identification of function distinguishable languages.

DOI10.1016/S0304-3975(02)00075-0zbMath1051.68092OpenAlexW2144638632MaRDI QIDQ1401186

Henning Fernau

Publication date: 17 August 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(02)00075-0

zbMATH Keywords

LearningFormal languagesGrammatical inferenceApproximate learningLanguage characterizationsLearning from textReversible languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (10)

Automatic learners with feedback queries ⋮ Inferring descriptive generalisations of formal languages ⋮ Learning tree languages from text ⋮ Learning Tree Languages ⋮ Learning Left-to-Right and Right-to-Left Iterative Languages ⋮ Automatic learning of subclasses of pattern languages ⋮ Learnability of automatic classes ⋮ Learning in the limit with lattice-structured hypothesis spaces ⋮ Algorithms for learning regular expressions from positive data ⋮ Automatic Learners with Feedback Queries

Cites Work

• Comparison of identification criteria for machine inductive inference
• Learning regular sets from queries and counterexamples
• Learning approximately regular languages with reversible languages
• Identifying terminal distinguishable languages
• A hierarchy of language families learnable by regular language learning
• A theory of the learnable
• Worst-case Analysis of Set Union Algorithms
• Inference of Reversible Languages
• Approximate language identification
• Noncounting Context-Free Languages
• Inductive inference of approximations
• Language identification in the limit
• Faster exact algorithms for hard problems: A parameterized point of view
• Parallel communicating grammar systems with terminal transmission
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Identification of function distinguishable languages.