Inductive inference of unbounded unions of pattern languages from positive data

DOI10.1016/S0304-3975(99)00270-4zbMath0944.68094WikidataQ59278909 ScholiaQ59278909MaRDI QIDQ5915396

No author found.

Publication date: 21 August 2000

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

zbMATH Keywords

pattern languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Learning elementary formal systems with queries., Revisiting Shinohara's algorithm for computing descriptive patterns, Closure properties of pattern languages, Learning languages in a union, Learning a subclass of regular patterns in polynomial time, Some classes of term rewriting systems inferable from positive data, Developments from enquiries into the learnability of the pattern languages from positive data, Inductive inference from all positive and some negative data, Case-based representation and learning of pattern languages, Learning concepts and their unions from positive data with refinement operators, Mind change complexity of inferring unbounded unions of restricted pattern languages from positive data, Unnamed Item, Ordinal mind change complexity of language identification

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A machine discovery from amino acid sequences by decision trees over regular patterns
• Inductive inference of monotonic formal systems from positive data
• Learning elementary formal systems
• Rich classes inferable from positive data: Length-bounded elementary formal systems
• Decision problems for patterns
• The theory of well-quasi-ordering: a frequently discovered concept
• A theory of the learnable
• Inductive inference of formal languages from positive data
• Monadic Elementary Formal Systems
• Language identification in the limit