Learning of Regular ω-Tree Languages

DOI10.1007/978-3-540-88009-7_27MaRDI QIDQ3528435zbMATH OpenOpenAlexFDO

Authors M. Jayasrirani, M. Humrosia Begam, Durairaj Gnanaraj Thomas

Publication date 16 October 2008

Published in Grammatical Inference: Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-88009-7_27

Mathematics Subject Classification ID

Computational learning theory (68Q32) Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45)

Recommendations

• Query learning of derived -tree languages in polynomial time
• Query learning of derived \(\omega\)-tree languages in polynomial time
• Learning of regular bi- languages
• Learning regular omega languages
• Learning regular omega languages

Cited in

(12)

• Learning regular languages from counterexamples
• A novel learning algorithm for Büchi automata based on family of DFAs and classification trees
• On the regularity and learnability of ordered DAG languages
• scientific article; zbMATH DE number 5854939 (Why is no real title available?)
• Learning regular omega languages
• A novel learning algorithm for Büchi automata based on family of DFAs and classification trees
• Learning of regular bi- languages
• Learning a regular tree language from a teacher
• Approximative learning of regular languages
• Query learning of derived -tree languages in polynomial time
• Query learning of derived \(\omega\)-tree languages in polynomial time
• Query learning of regular tree languages: How to avoid dead states

This page was built for publication: Learning of Regular ω-Tree Languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3528435)