Discovering unbounded unions of regular pattern languages from positive examples

DOI10.1007/BFB0009485zbMath1512.68124WikidataQ63979821 ScholiaQ63979821MaRDI QIDQ6487429

Jaak Vilo, Esko Ukkonen, A. Brazma

Publication date: 25 January 2023

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Related Items (1)

Learning a subclass of regular patterns in polynomial time

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Pattern recognition in several sequences: Consensus and alignment
• Inferring decision trees using the minimum description length principle
• Modeling by shortest data description
• Finding patterns common to a set of strings
• A Greedy Heuristic for the Set-Covering Problem
• A Space-Economical Suffix Tree Construction Algorithm
• Language identification in the limit

This page was built for publication: Discovering unbounded unions of regular pattern languages from positive examples