scientific article; zbMATH DE number 2040913

MaRDI QIDQ4452069zbMATH OpenFDO

Authors Johanna Högberg, Frank Drewes

Publication date 11 February 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2710/27100279.htm

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Recommendations

• Learning of Regular ω-Tree Languages
• Learning Tree Languages
• Learning regular tree languages from correction and equivalence queries
• scientific article; zbMATH DE number 2089360
• Learning tree languages from text
• Learning regular languages from counterexamples
• Learning Rational Stochastic Tree Languages
• Learning Commutative Regular Languages
• Query learning of regular tree languages: How to avoid dead states
• Partial learning of recursively enumerable languages

Cited in

(14)

• Learning Meets Verification
• Algorithmic Learning Theory
• Learning tree languages from text
• Learning Deterministically Recognizable Tree Series — Revisited
• Learning regular tree languages from correction and equivalence queries
• Four one-shot learners for regular tree languages and their polynomial characterizability
• Learning Tree Languages
• Learning algorithms
• Learning tree languages from positive examples and membership queries
• scientific article; zbMATH DE number 2089360 (Why is no real title available?)
• A categorical framework for learning generalised tree automata
• Learning pomset automata
• Query learning of regular tree languages: How to avoid dead states
• scientific article; zbMATH DE number 7561484 (Why is no real title available?)

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 Q4452069)