{"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}
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.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
