Regular Language Finite Automata California State University 正则语的有限自动机加利福尼亚州立大学.pptVIP

下载本文档

4
0
约9.37千字
约 32页
2018-06-19 发布于福建
举报
版权申诉

Regular Language Finite Automata California State University 正则语的有限自动机加利福尼亚州立大学.ppt

1、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
7、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

Regular Language Finite Automata California State University 正则语的有限自动机加利福尼亚州立大学

CS490 Presentation:Automata Language Theory Thong Lam Ran Shi Components of a Formal Language Symbol Alphabet String Grammar Components of a Formal Language Symbol A character, glyph, mark. An abstract entity that has no meaning by itself, often called uninterpreted. Letters from various alphabets, digits and special characters are the most commonly used symbols. Components of a Formal Language Alphabet A finite set of symbols. An alphabet is often denoted by sigma(Σ), yet can be given any name. B = {0, 1} Says B is an alphabet of two symbols, 0 and 1. C = {a, b, c} Says C is an alphabet of three symbols, a, b and c. Sometimes space and comma are in an alphabet while other times they are meta symbols used for descriptions. Components of a Formal Language String or Word A finite sequence of symbols from an alphabet. 01110 and 111 are strings from the alphabet B above. aaabccc and b are strings from the alphabet C above. A null string is a string with no symbols, usually denoted by epsilon(ε). The null string has length zero. The null string is usually denoted epsilon (ε). Vertical bars around a string indicate the length of a string expressed as a natural number. For example |00100| = 5, |aab| = 3, | epsilon | = 0 Components of a Formal Language Grammer A way to define a language by giving a finite set of rules that describe how valid strings may be constructed. Grammer(G) consists of an alphabet of terminals(Σ), variables(V), production rules(P) and a start symbol(S). G = (V, Σ, P, S). Formal Language A set of strings from an alphabet. The set may be empty, finite or infinite. L(M) is the notation for a language defined by a machine M. The machine M accepts a certain set of strings, thus a language. L(G) is the notation for a language defined by a grammar G. The grammar G recognizes a certain set of strings, thus a language. M(L) is the notation for a machine that accepts a language. The language L is a certain set of strings. G(L) is the notation for