计算机科学中的离散数学讲座

B. Khoussainov, Nodira Khoussainova
{"title":"计算机科学中的离散数学讲座","authors":"B. Khoussainov, Nodira Khoussainova","doi":"10.1142/8084","DOIUrl":null,"url":null,"abstract":"Definitions, Theorems, and Proofs Arithmetic Graphs Circuits Trees Basics of Sets Relations and Databases Induction Reachability Games on Graphs Functions and Transitions Propositional Logic Finite Automata Regular Expressions Counting Probability.","PeriodicalId":364397,"journal":{"name":"Algebra and Discrete Mathematics","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2012-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Lectures on Discrete Mathematics for Computer Science\",\"authors\":\"B. Khoussainov, Nodira Khoussainova\",\"doi\":\"10.1142/8084\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Definitions, Theorems, and Proofs Arithmetic Graphs Circuits Trees Basics of Sets Relations and Databases Induction Reachability Games on Graphs Functions and Transitions Propositional Logic Finite Automata Regular Expressions Counting Probability.\",\"PeriodicalId\":364397,\"journal\":{\"name\":\"Algebra and Discrete Mathematics\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-03-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Algebra and Discrete Mathematics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1142/8084\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Algebra and Discrete Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1142/8084","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

摘要

定义,定理和证明算术图电路树集合关系和数据库的基础图的归纳可达性游戏函数和转移命题逻辑有限自动机正则表达式计数概率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Lectures on Discrete Mathematics for Computer Science
Definitions, Theorems, and Proofs Arithmetic Graphs Circuits Trees Basics of Sets Relations and Databases Induction Reachability Games on Graphs Functions and Transitions Propositional Logic Finite Automata Regular Expressions Counting Probability.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Centralizers of Jacobian derivations On a finite state representation of GL(n,Z) Coarse selectors of groups Orbit isomorphic skeleton groups On new protocols of Noncommutative Cryptography in terms of homomorphism of stable multivariate transformation groups
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1