Mathematical foundations of computer science:
Mathematical Foundations of Computer Science introduces students to the discrete mathematics needed later in their Computer Science coursework with theory of computation topics interleaved throughout. Students learn about mathematical concepts just in time to apply them to theory of computation idea...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Boca Raton ; London ; New York
CRC Press, Taylor & Francis Group
2025
|
| Ausgabe: | First edition |
| Schlagworte: | |
| Zusammenfassung: | Mathematical Foundations of Computer Science introduces students to the discrete mathematics needed later in their Computer Science coursework with theory of computation topics interleaved throughout. Students learn about mathematical concepts just in time to apply them to theory of computation ideas. For instance, sets motivate the study of finite automata, direct proof is practised using closure properties, induction is used to prove the language of an automaton, and contradiction is used to apply the pumping lemma. The main content of the book starts with primitive data types such as sets and strings and ends with showing the undecidability of the halting problem. There are also appendix chapters on combinatorics, probability, elementary number theory, asymptotic notation, graphs, loop invariants, and recurrences. The content is laid out concisely with a heavy reliance on worked examples, of which there are over 250 in the book. Each chapter has exercises, totalling 550. This class-tested textbook is targeted to intermediate Computer Science majors, and it is primarily intended for a discrete math / proofs course in a Computer Science major. It is also suitable for introductory theory of computation courses.The authors hope this book breeds curiosity into the subject and is designed to satisfy this to some extent by reading this book. The book will prepare readers for deeper study of game theory applications in many fields of study |
| Beschreibung: | xiii, 213 Seiten Illustrationen 421 gr |
| ISBN: | 9781032467894 9781032467870 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV050033738 | ||
| 003 | DE-604 | ||
| 005 | 20250122 | ||
| 007 | t| | ||
| 008 | 241119s2025 xx a||| |||| 00||| eng d | ||
| 020 | |a 9781032467894 |c hbk |9 978-1-032-46789-4 | ||
| 020 | |a 9781032467870 |c pbk |9 978-1-032-46787-0 | ||
| 024 | 3 | |a 9781032467870 | |
| 035 | |a (DE-599)BVBBV050033738 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Lall, Ashwin |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Mathematical foundations of computer science |c Ashwin Lall |
| 250 | |a First edition | ||
| 264 | 1 | |a Boca Raton ; London ; New York |b CRC Press, Taylor & Francis Group |c 2025 | |
| 300 | |a xiii, 213 Seiten |b Illustrationen |c 421 gr | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 520 | |a Mathematical Foundations of Computer Science introduces students to the discrete mathematics needed later in their Computer Science coursework with theory of computation topics interleaved throughout. Students learn about mathematical concepts just in time to apply them to theory of computation ideas. For instance, sets motivate the study of finite automata, direct proof is practised using closure properties, induction is used to prove the language of an automaton, and contradiction is used to apply the pumping lemma. The main content of the book starts with primitive data types such as sets and strings and ends with showing the undecidability of the halting problem. There are also appendix chapters on combinatorics, probability, elementary number theory, asymptotic notation, graphs, loop invariants, and recurrences. The content is laid out concisely with a heavy reliance on worked examples, of which there are over 250 in the book. Each chapter has exercises, totalling 550. This class-tested textbook is targeted to intermediate Computer Science majors, and it is primarily intended for a discrete math / proofs course in a Computer Science major. It is also suitable for introductory theory of computation courses.The authors hope this book breeds curiosity into the subject and is designed to satisfy this to some extent by reading this book. The book will prepare readers for deeper study of game theory applications in many fields of study | ||
| 650 | 4 | |a bicssc / Information technology - general issues | |
| 650 | 4 | |a bicssc / Algorithms & data structures | |
| 650 | 4 | |a bicssc / Coding theory & cryptology | |
| 650 | 4 | |a bicssc / Discrete mathematics | |
| 650 | 4 | |a bisacsh / COMPUTERS / Computer Science | |
| 650 | 4 | |a bisacsh / COMPUTERS / Languages / General | |
| 650 | 4 | |a bisacsh / COMPUTERS / Mathematical & Statistical Software | |
| 650 | 4 | |a bisacsh / MATHEMATICS / General | |
| 650 | 4 | |a bisacsh / MATHEMATICS / Applied | |
| 650 | 4 | |a bisacsh / MATHEMATICS / Discrete Mathematics | |
| 650 | 4 | |a bisacsh / MATHEMATICS / Logic | |
| 650 | 0 | 7 | |a Kombinatorik |0 (DE-588)4031824-2 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Elementare Zahlentheorie |0 (DE-588)4294368-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Informatik |0 (DE-588)4026894-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Asymptotische Darstellung |0 (DE-588)4003339-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Diskrete Mathematik |0 (DE-588)4129143-8 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Diskrete Mathematik |0 (DE-588)4129143-8 |D s |
| 689 | 0 | 1 | |a Informatik |0 (DE-588)4026894-9 |D s |
| 689 | 0 | 2 | |a Kombinatorik |0 (DE-588)4031824-2 |D s |
| 689 | 0 | 3 | |a Elementare Zahlentheorie |0 (DE-588)4294368-1 |D s |
| 689 | 0 | 4 | |a Asymptotische Darstellung |0 (DE-588)4003339-9 |D s |
| 689 | 0 | |5 DE-604 | |
| 776 | 0 | 8 | |i Erscheint auch als |n Online-Ausgabe |z 978-1-003-38328-4 |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-035371622 | |
Datensatz im Suchindex
| _version_ | 1821961677930758144 |
|---|---|
| adam_text | |
| any_adam_object | |
| author | Lall, Ashwin |
| author_facet | Lall, Ashwin |
| author_role | aut |
| author_sort | Lall, Ashwin |
| author_variant | a l al |
| building | Verbundindex |
| bvnumber | BV050033738 |
| ctrlnum | (DE-599)BVBBV050033738 |
| edition | First edition |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 c 4500</leader><controlfield tag="001">BV050033738</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20250122</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">241119s2025 xx a||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781032467894</subfield><subfield code="c">hbk</subfield><subfield code="9">978-1-032-46789-4</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781032467870</subfield><subfield code="c">pbk</subfield><subfield code="9">978-1-032-46787-0</subfield></datafield><datafield tag="024" ind1="3" ind2=" "><subfield code="a">9781032467870</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV050033738</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-29T</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Lall, Ashwin</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Mathematical foundations of computer science</subfield><subfield code="c">Ashwin Lall</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">First edition</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Boca Raton ; London ; New York</subfield><subfield code="b">CRC Press, Taylor & Francis Group</subfield><subfield code="c">2025</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">xiii, 213 Seiten</subfield><subfield code="b">Illustrationen</subfield><subfield code="c">421 gr</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Mathematical Foundations of Computer Science introduces students to the discrete mathematics needed later in their Computer Science coursework with theory of computation topics interleaved throughout. Students learn about mathematical concepts just in time to apply them to theory of computation ideas. For instance, sets motivate the study of finite automata, direct proof is practised using closure properties, induction is used to prove the language of an automaton, and contradiction is used to apply the pumping lemma. The main content of the book starts with primitive data types such as sets and strings and ends with showing the undecidability of the halting problem. There are also appendix chapters on combinatorics, probability, elementary number theory, asymptotic notation, graphs, loop invariants, and recurrences. The content is laid out concisely with a heavy reliance on worked examples, of which there are over 250 in the book. Each chapter has exercises, totalling 550. This class-tested textbook is targeted to intermediate Computer Science majors, and it is primarily intended for a discrete math / proofs course in a Computer Science major. It is also suitable for introductory theory of computation courses.The authors hope this book breeds curiosity into the subject and is designed to satisfy this to some extent by reading this book. The book will prepare readers for deeper study of game theory applications in many fields of study</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">bicssc / Information technology - general issues</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">bicssc / Algorithms & data structures</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">bicssc / Coding theory & cryptology</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">bicssc / Discrete mathematics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">bisacsh / COMPUTERS / Computer Science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">bisacsh / COMPUTERS / Languages / General</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">bisacsh / COMPUTERS / Mathematical & Statistical Software</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">bisacsh / MATHEMATICS / General</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">bisacsh / MATHEMATICS / Applied</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">bisacsh / MATHEMATICS / Discrete Mathematics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">bisacsh / MATHEMATICS / Logic</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Kombinatorik</subfield><subfield code="0">(DE-588)4031824-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Elementare Zahlentheorie</subfield><subfield code="0">(DE-588)4294368-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Informatik</subfield><subfield code="0">(DE-588)4026894-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Asymptotische Darstellung</subfield><subfield code="0">(DE-588)4003339-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Diskrete Mathematik</subfield><subfield code="0">(DE-588)4129143-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Diskrete Mathematik</subfield><subfield code="0">(DE-588)4129143-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Informatik</subfield><subfield code="0">(DE-588)4026894-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Kombinatorik</subfield><subfield code="0">(DE-588)4031824-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="3"><subfield code="a">Elementare Zahlentheorie</subfield><subfield code="0">(DE-588)4294368-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="4"><subfield code="a">Asymptotische Darstellung</subfield><subfield code="0">(DE-588)4003339-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Online-Ausgabe</subfield><subfield code="z">978-1-003-38328-4</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-035371622</subfield></datafield></record></collection> |
| id | DE-604.BV050033738 |
| illustrated | Illustrated |
| indexdate | 2025-01-22T15:00:57Z |
| institution | BVB |
| isbn | 9781032467894 9781032467870 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-035371622 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | xiii, 213 Seiten Illustrationen 421 gr |
| publishDate | 2025 |
| publishDateSearch | 2025 |
| publishDateSort | 2025 |
| publisher | CRC Press, Taylor & Francis Group |
| record_format | marc |
| spelling | Lall, Ashwin Verfasser aut Mathematical foundations of computer science Ashwin Lall First edition Boca Raton ; London ; New York CRC Press, Taylor & Francis Group 2025 xiii, 213 Seiten Illustrationen 421 gr txt rdacontent n rdamedia nc rdacarrier Mathematical Foundations of Computer Science introduces students to the discrete mathematics needed later in their Computer Science coursework with theory of computation topics interleaved throughout. Students learn about mathematical concepts just in time to apply them to theory of computation ideas. For instance, sets motivate the study of finite automata, direct proof is practised using closure properties, induction is used to prove the language of an automaton, and contradiction is used to apply the pumping lemma. The main content of the book starts with primitive data types such as sets and strings and ends with showing the undecidability of the halting problem. There are also appendix chapters on combinatorics, probability, elementary number theory, asymptotic notation, graphs, loop invariants, and recurrences. The content is laid out concisely with a heavy reliance on worked examples, of which there are over 250 in the book. Each chapter has exercises, totalling 550. This class-tested textbook is targeted to intermediate Computer Science majors, and it is primarily intended for a discrete math / proofs course in a Computer Science major. It is also suitable for introductory theory of computation courses.The authors hope this book breeds curiosity into the subject and is designed to satisfy this to some extent by reading this book. The book will prepare readers for deeper study of game theory applications in many fields of study bicssc / Information technology - general issues bicssc / Algorithms & data structures bicssc / Coding theory & cryptology bicssc / Discrete mathematics bisacsh / COMPUTERS / Computer Science bisacsh / COMPUTERS / Languages / General bisacsh / COMPUTERS / Mathematical & Statistical Software bisacsh / MATHEMATICS / General bisacsh / MATHEMATICS / Applied bisacsh / MATHEMATICS / Discrete Mathematics bisacsh / MATHEMATICS / Logic Kombinatorik (DE-588)4031824-2 gnd rswk-swf Elementare Zahlentheorie (DE-588)4294368-1 gnd rswk-swf Informatik (DE-588)4026894-9 gnd rswk-swf Asymptotische Darstellung (DE-588)4003339-9 gnd rswk-swf Diskrete Mathematik (DE-588)4129143-8 gnd rswk-swf Diskrete Mathematik (DE-588)4129143-8 s Informatik (DE-588)4026894-9 s Kombinatorik (DE-588)4031824-2 s Elementare Zahlentheorie (DE-588)4294368-1 s Asymptotische Darstellung (DE-588)4003339-9 s DE-604 Erscheint auch als Online-Ausgabe 978-1-003-38328-4 |
| spellingShingle | Lall, Ashwin Mathematical foundations of computer science bicssc / Information technology - general issues bicssc / Algorithms & data structures bicssc / Coding theory & cryptology bicssc / Discrete mathematics bisacsh / COMPUTERS / Computer Science bisacsh / COMPUTERS / Languages / General bisacsh / COMPUTERS / Mathematical & Statistical Software bisacsh / MATHEMATICS / General bisacsh / MATHEMATICS / Applied bisacsh / MATHEMATICS / Discrete Mathematics bisacsh / MATHEMATICS / Logic Kombinatorik (DE-588)4031824-2 gnd Elementare Zahlentheorie (DE-588)4294368-1 gnd Informatik (DE-588)4026894-9 gnd Asymptotische Darstellung (DE-588)4003339-9 gnd Diskrete Mathematik (DE-588)4129143-8 gnd |
| subject_GND | (DE-588)4031824-2 (DE-588)4294368-1 (DE-588)4026894-9 (DE-588)4003339-9 (DE-588)4129143-8 |
| title | Mathematical foundations of computer science |
| title_auth | Mathematical foundations of computer science |
| title_exact_search | Mathematical foundations of computer science |
| title_full | Mathematical foundations of computer science Ashwin Lall |
| title_fullStr | Mathematical foundations of computer science Ashwin Lall |
| title_full_unstemmed | Mathematical foundations of computer science Ashwin Lall |
| title_short | Mathematical foundations of computer science |
| title_sort | mathematical foundations of computer science |
| topic | bicssc / Information technology - general issues bicssc / Algorithms & data structures bicssc / Coding theory & cryptology bicssc / Discrete mathematics bisacsh / COMPUTERS / Computer Science bisacsh / COMPUTERS / Languages / General bisacsh / COMPUTERS / Mathematical & Statistical Software bisacsh / MATHEMATICS / General bisacsh / MATHEMATICS / Applied bisacsh / MATHEMATICS / Discrete Mathematics bisacsh / MATHEMATICS / Logic Kombinatorik (DE-588)4031824-2 gnd Elementare Zahlentheorie (DE-588)4294368-1 gnd Informatik (DE-588)4026894-9 gnd Asymptotische Darstellung (DE-588)4003339-9 gnd Diskrete Mathematik (DE-588)4129143-8 gnd |
| topic_facet | bicssc / Information technology - general issues bicssc / Algorithms & data structures bicssc / Coding theory & cryptology bicssc / Discrete mathematics bisacsh / COMPUTERS / Computer Science bisacsh / COMPUTERS / Languages / General bisacsh / COMPUTERS / Mathematical & Statistical Software bisacsh / MATHEMATICS / General bisacsh / MATHEMATICS / Applied bisacsh / MATHEMATICS / Discrete Mathematics bisacsh / MATHEMATICS / Logic Kombinatorik Elementare Zahlentheorie Informatik Asymptotische Darstellung Diskrete Mathematik |
| work_keys_str_mv | AT lallashwin mathematicalfoundationsofcomputerscience |