﻿<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:trackback="http://madskills.com/public/xml/rss/module/trackback/" xmlns:wfw="http://wellformedweb.org/CommentAPI/" xmlns:slash="http://purl.org/rss/1.0/modules/slash/"><channel><title>C++博客-Why so serious?   --[NKU]schindlerlee-随笔分类-CS其他</title><link>http://www.cppblog.com/schindlerlee/category/15872.html</link><description /><language>zh-cn</language><lastBuildDate>Fri, 14 Jan 2011 13:20:45 GMT</lastBuildDate><pubDate>Fri, 14 Jan 2011 13:20:45 GMT</pubDate><ttl>60</ttl><item><title>2010 随机过程考试题(回忆版)</title><link>http://www.cppblog.com/schindlerlee/archive/2011/01/14/138542.html</link><dc:creator>schindlerlee</dc:creator><author>schindlerlee</author><pubDate>Fri, 14 Jan 2011 08:01:00 GMT</pubDate><guid>http://www.cppblog.com/schindlerlee/archive/2011/01/14/138542.html</guid><wfw:comment>http://www.cppblog.com/schindlerlee/comments/138542.html</wfw:comment><comments>http://www.cppblog.com/schindlerlee/archive/2011/01/14/138542.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/schindlerlee/comments/commentRss/138542.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/schindlerlee/services/trackbacks/138542.html</trackback:ping><description><![CDATA[一、<br />
1.投硬币三次，给出概率空间，定义一个随机变量，并给出图像<br />
2.在[0,1]上随机取两个点，求两点距离的分布函数，并给出期望和方差。<br />
3.有四条生产线，分别给出生产合格品的概率，求抽到不合格的概率。如果抽到合格的，求出每条生产线的贡献百分比。<br />

二、<br />
1.抽球，a个红，b个黑，X(n)表示第n此及其之前总共抽到的红球数，给出转移矩阵。<br />
  求P{X(1) = 1, X(3) = 3}
2.给一个4x4的概率矩阵，分析状态的常返性，周期，平均返回时间<br />
3.3个机床，2个维修工的MM2排队系统。求稳态分布，工人空闲的概率和平均维修的机床数.<br /><img src ="http://www.cppblog.com/schindlerlee/aggbug/138542.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/schindlerlee/" target="_blank">schindlerlee</a> 2011-01-14 16:01 <a href="http://www.cppblog.com/schindlerlee/archive/2011/01/14/138542.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>2010 形式语言与自动机考试题(回忆版)</title><link>http://www.cppblog.com/schindlerlee/archive/2011/01/12/138411.html</link><dc:creator>schindlerlee</dc:creator><author>schindlerlee</author><pubDate>Wed, 12 Jan 2011 13:39:00 GMT</pubDate><guid>http://www.cppblog.com/schindlerlee/archive/2011/01/12/138411.html</guid><wfw:comment>http://www.cppblog.com/schindlerlee/comments/138411.html</wfw:comment><comments>http://www.cppblog.com/schindlerlee/archive/2011/01/12/138411.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/schindlerlee/comments/commentRss/138411.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/schindlerlee/services/trackbacks/138411.html</trackback:ping><description><![CDATA[我也不明白为什么都没有NFA和DFA的内容。。。<br />一共5个题，题目就二十来行，挤在半页上，5页16开纸四页半都是白的。。<br /><br />1.证明{a<sup>n</sup>b<sup>m</sup>c<sup>k</sup>;k != m + n}不是正则文法<br />
2.用CYK算法(2维矩阵,3维dp), 判断一个串是不是属于一个上下文无关文法<br />
3.设计一个图灵机接受W<sup>n</sup>,W是0，1组成的串<br />
4.证明{a<sup>n</sup>b<sup>n</sup>|n不是5的倍数}不是上下文无关文法<br />
5.化简一个上下文无关文法，去掉空表达式，无效表达式，化成Chomsky范式<br /><img src ="http://www.cppblog.com/schindlerlee/aggbug/138411.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/schindlerlee/" target="_blank">schindlerlee</a> 2011-01-12 21:39 <a href="http://www.cppblog.com/schindlerlee/archive/2011/01/12/138411.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>