首页 | 本学科首页   官方微博 | 高级检索  
     


Learning Probabilistic Automata and Markov Chains via Queries
Authors:Tzeng  Wen-Guey
Affiliation:(1) Department of Computer Science, State University of New York at Stony Brook, Stony Brook, NY, 11794
Abstract:We investigate the problem of learning probabilistic automata and Markov chains via queries in the teacher-student learning model. Probabilistic automata and Markov chains are probabilistic extensions of finite state automata and have similar structures. We discuss some natural oracles associated with probabilistic automata and Markov chains. We present polynomial-time algorithms for learning probabilistic automata and Markov Chains using these oracles.
Keywords:Learning via oracles  probabilistic automaton  deterministic finite automaton  Markov chain
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号