Discovering unbounded unions of regular pattern languages from positive examples
From MaRDI portal
Publication:6487429
DOI10.1007/BFB0009485zbMATH Open1512.68124WikidataQ63979821 ScholiaQ63979821MaRDI QIDQ6487429FDOQ6487429
Authors: A. Brazma, Esko Ukkonen, Jaak Vilo 
Publication date: 25 January 2023
Recommendations
- Inductive inference of unbounded unions of pattern languages from positive data
- Inductive inference of unbounded unions of pattern languages from positive data
- scientific article; zbMATH DE number 2143051
- scientific article; zbMATH DE number 408772
- Algorithmic Learning Theory
- scientific article; zbMATH DE number 1301793
- scientific article; zbMATH DE number 1966624
- Inferring uniquely terminating regular languages from positive data
- On classes of tractable unrestricted regular expressions
- scientific article; zbMATH DE number 1453051
Cites Work
- A Greedy Heuristic for the Set-Covering Problem
- Modeling by shortest data description
- Language identification in the limit
- Finding patterns common to a set of strings
- A Space-Economical Suffix Tree Construction Algorithm
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Inferring decision trees using the minimum description length principle
- Pattern recognition in several sequences: Consensus and alignment
Cited In (7)
- Learning a subclass of regular patterns in polynomial time
- Implementation and Application of Automata
- Title not available (Why is that?)
- On learning unions of pattern languages and tree patterns in the mistake bound model.
- Inductive inference of unbounded unions of pattern languages from positive data
- Algorithmic Learning Theory
- Computing and Combinatorics
This page was built for publication: Discovering unbounded unions of regular pattern languages from positive examples
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6487429)
