Computability, complexity, and languages: fundamentals of theoretical computer science
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Boston
Academic Press, Harcourt, Brace
1994
|
| Ausgabe: | second edition |
| Schriftenreihe: | Computer science and scientific computing
|
| Schlagworte: | |
| Online-Zugang: | FAW01 Volltext |
| Beschreibung: | Includes bibliographical references (pages 593-594)-and indexes This introductory text covers the key areas of computer science, including recursive function theory, formal languages, and automata. It assumes a minimal background in formal mathematics. The book is divided into five parts: Computability, Grammars and Automata, Logic, Complexity, and Unsolvability. * Computability theory is introduced in a manner that makes maximum use of previous programming experience, including a "universal" program that takes up less than a page. * The number of exercises included has more than tripled. * Automata theory, computational logic, and complexity theory are presented in a flexible manner, and can be covered in a variety of different arrangements |
| Beschreibung: | xix, 609 pages |
| ISBN: | 9780080502465 0080502466 0122063821 9780122063824 |
Internformat
MARC
| LEADER | 00000nmm a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV044388364 | ||
| 003 | DE-604 | ||
| 005 | 20230110 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 170630s1994 |||| o||u| ||||||eng d | ||
| 020 | |a 9780080502465 |9 978-0-08-050246-5 | ||
| 020 | |a 0080502466 |9 0-08-050246-6 | ||
| 020 | |a 0122063821 |9 0-12-206382-1 | ||
| 020 | |a 9780122063824 |9 978-0-12-206382-4 | ||
| 035 | |a (ZDB-33-ESD)ocn815471193 | ||
| 035 | |a (OCoLC)815471193 | ||
| 035 | |a (DE-599)BVBBV044388364 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-1046 | ||
| 082 | 0 | |a 511.3 |2 20 | |
| 084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
| 100 | 1 | |a Davis, Martin |d 1928-2023 |e Verfasser |0 (DE-588)116040866 |4 aut | |
| 245 | 1 | 0 | |a Computability, complexity, and languages |b fundamentals of theoretical computer science |c Martin D. Davis, Ron Sigal, Elaine J. Weyuker |
| 250 | |a second edition | ||
| 264 | 1 | |a Boston |b Academic Press, Harcourt, Brace |c 1994 | |
| 300 | |a xix, 609 pages | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a Computer science and scientific computing | |
| 500 | |a Includes bibliographical references (pages 593-594)-and indexes | ||
| 500 | |a This introductory text covers the key areas of computer science, including recursive function theory, formal languages, and automata. It assumes a minimal background in formal mathematics. The book is divided into five parts: Computability, Grammars and Automata, Logic, Complexity, and Unsolvability. * Computability theory is introduced in a manner that makes maximum use of previous programming experience, including a "universal" program that takes up less than a page. * The number of exercises included has more than tripled. * Automata theory, computational logic, and complexity theory are presented in a flexible manner, and can be covered in a variety of different arrangements | ||
| 650 | 4 | |a Computational complexity | |
| 650 | 4 | |a Formal languages | |
| 650 | 4 | |a Machine theory | |
| 650 | 7 | |a MATHEMATICS / Infinity |2 bisacsh | |
| 650 | 7 | |a MATHEMATICS / Logic |2 bisacsh | |
| 650 | 7 | |a Computational complexity |2 fast | |
| 650 | 7 | |a Formal languages |2 fast | |
| 650 | 7 | |a Machine theory |2 fast | |
| 650 | 4 | |a Machine theory | |
| 650 | 4 | |a Computational complexity | |
| 650 | 4 | |a Formal languages | |
| 650 | 0 | 7 | |a Komplexität |0 (DE-588)4135369-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Formale Sprache |0 (DE-588)4017848-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Automatentheorie |0 (DE-588)4003953-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Theoretische Informatik |0 (DE-588)4196735-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Berechenbarkeit |0 (DE-588)4138368-0 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Komplexität |0 (DE-588)4135369-9 |D s |
| 689 | 0 | |8 1\p |5 DE-604 | |
| 689 | 1 | 0 | |a Berechenbarkeit |0 (DE-588)4138368-0 |D s |
| 689 | 1 | |8 2\p |5 DE-604 | |
| 689 | 2 | 0 | |a Formale Sprache |0 (DE-588)4017848-1 |D s |
| 689 | 2 | |8 3\p |5 DE-604 | |
| 689 | 3 | 0 | |a Automatentheorie |0 (DE-588)4003953-5 |D s |
| 689 | 3 | |8 4\p |5 DE-604 | |
| 689 | 4 | 0 | |a Theoretische Informatik |0 (DE-588)4196735-5 |D s |
| 689 | 4 | |8 5\p |5 DE-604 | |
| 700 | 1 | |a Sigal, Ron |e Sonstige |4 oth | |
| 700 | 1 | |a Weyuker, Elaine J. |e Sonstige |0 (DE-588)135877199 |4 oth | |
| 856 | 4 | 0 | |u hhttps://www.sciencedirect.com/book/9780122063824 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
| 912 | |a ZDB-33-ESD | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-029790585 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 2\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 3\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 4\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 5\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 966 | e | |u https://www.sciencedirect.com/book/9780122063824 |l FAW01 |p ZDB-33-ESD |q FAW_PDA_ESD |x Verlag |3 Volltext | |
| 966 | e | |u https://www.sciencedirect.com/book/9780122063824 |l FAW01 |p ZDB-33-ESD |q FAW_Textbooks_EBETEC |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804177658404143104 |
|---|---|
| any_adam_object | |
| author | Davis, Martin 1928-2023 |
| author_GND | (DE-588)116040866 (DE-588)135877199 |
| author_facet | Davis, Martin 1928-2023 |
| author_role | aut |
| author_sort | Davis, Martin 1928-2023 |
| author_variant | m d md |
| building | Verbundindex |
| bvnumber | BV044388364 |
| classification_rvk | ST 134 |
| collection | ZDB-33-ESD |
| ctrlnum | (ZDB-33-ESD)ocn815471193 (OCoLC)815471193 (DE-599)BVBBV044388364 |
| dewey-full | 511.3 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511.3 |
| dewey-search | 511.3 |
| dewey-sort | 3511.3 |
| dewey-tens | 510 - Mathematics |
| discipline | Informatik Mathematik |
| edition | second edition |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>04058nmm a2200817zc 4500</leader><controlfield tag="001">BV044388364</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20230110 </controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">170630s1994 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780080502465</subfield><subfield code="9">978-0-08-050246-5</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0080502466</subfield><subfield code="9">0-08-050246-6</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0122063821</subfield><subfield code="9">0-12-206382-1</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780122063824</subfield><subfield code="9">978-0-12-206382-4</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-33-ESD)ocn815471193</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)815471193</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV044388364</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-1046</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.3</subfield><subfield code="2">20</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 134</subfield><subfield code="0">(DE-625)143590:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Davis, Martin</subfield><subfield code="d">1928-2023</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)116040866</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Computability, complexity, and languages</subfield><subfield code="b">fundamentals of theoretical computer science</subfield><subfield code="c">Martin D. Davis, Ron Sigal, Elaine J. Weyuker</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">second edition</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Boston</subfield><subfield code="b">Academic Press, Harcourt, Brace</subfield><subfield code="c">1994</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">xix, 609 pages</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">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Computer science and scientific computing</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references (pages 593-594)-and indexes</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">This introductory text covers the key areas of computer science, including recursive function theory, formal languages, and automata. It assumes a minimal background in formal mathematics. The book is divided into five parts: Computability, Grammars and Automata, Logic, Complexity, and Unsolvability. * Computability theory is introduced in a manner that makes maximum use of previous programming experience, including a "universal" program that takes up less than a page. * The number of exercises included has more than tripled. * Automata theory, computational logic, and complexity theory are presented in a flexible manner, and can be covered in a variety of different arrangements</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Formal languages</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Machine theory</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">MATHEMATICS / Infinity</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">MATHEMATICS / Logic</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computational complexity</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Formal languages</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Machine theory</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Machine theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Formal languages</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Komplexität</subfield><subfield code="0">(DE-588)4135369-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Formale Sprache</subfield><subfield code="0">(DE-588)4017848-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Automatentheorie</subfield><subfield code="0">(DE-588)4003953-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Theoretische Informatik</subfield><subfield code="0">(DE-588)4196735-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Berechenbarkeit</subfield><subfield code="0">(DE-588)4138368-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Komplexität</subfield><subfield code="0">(DE-588)4135369-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Berechenbarkeit</subfield><subfield code="0">(DE-588)4138368-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Formale Sprache</subfield><subfield code="0">(DE-588)4017848-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="8">3\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="3" ind2="0"><subfield code="a">Automatentheorie</subfield><subfield code="0">(DE-588)4003953-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="3" ind2=" "><subfield code="8">4\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="4" ind2="0"><subfield code="a">Theoretische Informatik</subfield><subfield code="0">(DE-588)4196735-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="4" ind2=" "><subfield code="8">5\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Sigal, Ron</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Weyuker, Elaine J.</subfield><subfield code="e">Sonstige</subfield><subfield code="0">(DE-588)135877199</subfield><subfield code="4">oth</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">hhttps://www.sciencedirect.com/book/9780122063824</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Erstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-33-ESD</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-029790585</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">3\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">4\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">5\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://www.sciencedirect.com/book/9780122063824</subfield><subfield code="l">FAW01</subfield><subfield code="p">ZDB-33-ESD</subfield><subfield code="q">FAW_PDA_ESD</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://www.sciencedirect.com/book/9780122063824</subfield><subfield code="l">FAW01</subfield><subfield code="p">ZDB-33-ESD</subfield><subfield code="q">FAW_Textbooks_EBETEC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV044388364 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T07:51:35Z |
| institution | BVB |
| isbn | 9780080502465 0080502466 0122063821 9780122063824 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-029790585 |
| oclc_num | 815471193 |
| open_access_boolean | |
| owner | DE-1046 |
| owner_facet | DE-1046 |
| physical | xix, 609 pages |
| psigel | ZDB-33-ESD ZDB-33-ESD FAW_PDA_ESD ZDB-33-ESD FAW_Textbooks_EBETEC |
| publishDate | 1994 |
| publishDateSearch | 1994 |
| publishDateSort | 1994 |
| publisher | Academic Press, Harcourt, Brace |
| record_format | marc |
| series2 | Computer science and scientific computing |
| spelling | Davis, Martin 1928-2023 Verfasser (DE-588)116040866 aut Computability, complexity, and languages fundamentals of theoretical computer science Martin D. Davis, Ron Sigal, Elaine J. Weyuker second edition Boston Academic Press, Harcourt, Brace 1994 xix, 609 pages txt rdacontent c rdamedia cr rdacarrier Computer science and scientific computing Includes bibliographical references (pages 593-594)-and indexes This introductory text covers the key areas of computer science, including recursive function theory, formal languages, and automata. It assumes a minimal background in formal mathematics. The book is divided into five parts: Computability, Grammars and Automata, Logic, Complexity, and Unsolvability. * Computability theory is introduced in a manner that makes maximum use of previous programming experience, including a "universal" program that takes up less than a page. * The number of exercises included has more than tripled. * Automata theory, computational logic, and complexity theory are presented in a flexible manner, and can be covered in a variety of different arrangements Computational complexity Formal languages Machine theory MATHEMATICS / Infinity bisacsh MATHEMATICS / Logic bisacsh Computational complexity fast Formal languages fast Machine theory fast Komplexität (DE-588)4135369-9 gnd rswk-swf Formale Sprache (DE-588)4017848-1 gnd rswk-swf Automatentheorie (DE-588)4003953-5 gnd rswk-swf Theoretische Informatik (DE-588)4196735-5 gnd rswk-swf Berechenbarkeit (DE-588)4138368-0 gnd rswk-swf Komplexität (DE-588)4135369-9 s 1\p DE-604 Berechenbarkeit (DE-588)4138368-0 s 2\p DE-604 Formale Sprache (DE-588)4017848-1 s 3\p DE-604 Automatentheorie (DE-588)4003953-5 s 4\p DE-604 Theoretische Informatik (DE-588)4196735-5 s 5\p DE-604 Sigal, Ron Sonstige oth Weyuker, Elaine J. Sonstige (DE-588)135877199 oth hhttps://www.sciencedirect.com/book/9780122063824 Verlag URL des Erstveröffentlichers Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 2\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 3\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 4\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 5\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Davis, Martin 1928-2023 Computability, complexity, and languages fundamentals of theoretical computer science Computational complexity Formal languages Machine theory MATHEMATICS / Infinity bisacsh MATHEMATICS / Logic bisacsh Computational complexity fast Formal languages fast Machine theory fast Komplexität (DE-588)4135369-9 gnd Formale Sprache (DE-588)4017848-1 gnd Automatentheorie (DE-588)4003953-5 gnd Theoretische Informatik (DE-588)4196735-5 gnd Berechenbarkeit (DE-588)4138368-0 gnd |
| subject_GND | (DE-588)4135369-9 (DE-588)4017848-1 (DE-588)4003953-5 (DE-588)4196735-5 (DE-588)4138368-0 |
| title | Computability, complexity, and languages fundamentals of theoretical computer science |
| title_auth | Computability, complexity, and languages fundamentals of theoretical computer science |
| title_exact_search | Computability, complexity, and languages fundamentals of theoretical computer science |
| title_full | Computability, complexity, and languages fundamentals of theoretical computer science Martin D. Davis, Ron Sigal, Elaine J. Weyuker |
| title_fullStr | Computability, complexity, and languages fundamentals of theoretical computer science Martin D. Davis, Ron Sigal, Elaine J. Weyuker |
| title_full_unstemmed | Computability, complexity, and languages fundamentals of theoretical computer science Martin D. Davis, Ron Sigal, Elaine J. Weyuker |
| title_short | Computability, complexity, and languages |
| title_sort | computability complexity and languages fundamentals of theoretical computer science |
| title_sub | fundamentals of theoretical computer science |
| topic | Computational complexity Formal languages Machine theory MATHEMATICS / Infinity bisacsh MATHEMATICS / Logic bisacsh Computational complexity fast Formal languages fast Machine theory fast Komplexität (DE-588)4135369-9 gnd Formale Sprache (DE-588)4017848-1 gnd Automatentheorie (DE-588)4003953-5 gnd Theoretische Informatik (DE-588)4196735-5 gnd Berechenbarkeit (DE-588)4138368-0 gnd |
| topic_facet | Computational complexity Formal languages Machine theory MATHEMATICS / Infinity MATHEMATICS / Logic Komplexität Formale Sprache Automatentheorie Theoretische Informatik Berechenbarkeit |
| url | hhttps://www.sciencedirect.com/book/9780122063824 |
| work_keys_str_mv | AT davismartin computabilitycomplexityandlanguagesfundamentalsoftheoreticalcomputerscience AT sigalron computabilitycomplexityandlanguagesfundamentalsoftheoreticalcomputerscience AT weyukerelainej computabilitycomplexityandlanguagesfundamentalsoftheoreticalcomputerscience |