scientific article; zbMATH DE number 517032
From MaRDI portal
Publication:4282559
Recommendations
- Polynomial-time inference of arbitrary pattern languages
- scientific article; zbMATH DE number 3868655
- scientific article; zbMATH DE number 67610
- scientific article; zbMATH DE number 996383
- A Polynomial Algorithm for the Inference of Context Free Languages
- A note on the complexity of matching patterns with variables
- Polynomial-time algorithms for learning typed pattern languages
- Polynomial Time Algorithms for Learning k-Reversible Languages and Pattern Languages with Correction Queries
Cited in
(13)- Identification of pattern languages from examples and queries
- A note on the two-variable pattern-finding problem
- Robust learning -- rich and poor
- Revisiting Shinohara's algorithm for computing descriptive patterns
- Polynomial-time algorithms for learning typed pattern languages
- scientific article; zbMATH DE number 996383 (Why is no real title available?)
- scientific article; zbMATH DE number 3868655 (Why is no real title available?)
- scientific article; zbMATH DE number 67610 (Why is no real title available?)
- scientific article; zbMATH DE number 1301802 (Why is no real title available?)
- scientific article; zbMATH DE number 2149593 (Why is no real title available?)
- scientific article; zbMATH DE number 1453031 (Why is no real title available?)
- Case-based representation and learning of pattern languages
- Polynomial-time inference of arbitrary pattern languages
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4282559)