Introduction to the theory of computation:
Gain a solid understanding of the fundamental mathematical properties of computer hardware, software, and applications with a blend of practical and philosophical coverage and mathematical treatments, including advanced theorems and proofs. This books comprehensive coverage makes it a valuable refer...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Australia ; Brazil ; Japan ; Korea ; Mexico ; Singapore ; Spain ; United Kingdom ; United States
Cengage Learning
[2013]
|
| Ausgabe: | Third edition |
| Schlagworte: | |
| Online-Zugang: | DE-91 |
| Zusammenfassung: | Gain a solid understanding of the fundamental mathematical properties of computer hardware, software, and applications with a blend of practical and philosophical coverage and mathematical treatments, including advanced theorems and proofs. This books comprehensive coverage makes it a valuable reference for studies in theoretical computing |
| Beschreibung: | 1 Online-Ressource (xxii, 458 Seiten) Illustrationen |
| Format: | Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002 |
| ISBN: | 9781285401065 1285401069 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV049904876 | ||
| 003 | DE-604 | ||
| 005 | 20241107 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 241014s2013 xx a||| ob||| 00||| eng d | ||
| 020 | |a 9781285401065 |9 978-1-285-40106-5 | ||
| 020 | |a 1285401069 |9 1285401069 | ||
| 035 | |a (OCoLC)1477596328 | ||
| 035 | |a (DE-599)BVBBV049904876 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 084 | |a ST 130 |0 (DE-625)143588: |2 rvk | ||
| 084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
| 084 | |a ST 136 |0 (DE-625)143591: |2 rvk | ||
| 084 | |a DAT 500 |2 stub | ||
| 100 | 1 | |a Sipser, Michael |e Verfasser |0 (DE-588)131513176 |4 aut | |
| 245 | 1 | 0 | |a Introduction to the theory of computation |c Michael Sipser |
| 250 | |a Third edition | ||
| 264 | 1 | |a Australia ; Brazil ; Japan ; Korea ; Mexico ; Singapore ; Spain ; United Kingdom ; United States |b Cengage Learning |c [2013] | |
| 300 | |a 1 Online-Ressource (xxii, 458 Seiten) |b Illustrationen | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 505 | 8 | 0 | |t Automata and languages |t Regular languages |t Context-free languages -- |t Computability theory |t The Church-Turing thesis |t Decidability |t Reducibility |t Advanced topics in computability theory -- |t Complexity theory |t Time complexity |t Space complexity |t Intractability |t Advanced topics in complexity theory |
| 520 | 3 | |a Gain a solid understanding of the fundamental mathematical properties of computer hardware, software, and applications with a blend of practical and philosophical coverage and mathematical treatments, including advanced theorems and proofs. This books comprehensive coverage makes it a valuable reference for studies in theoretical computing | |
| 538 | |a Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002 |u http://purl.oclc.org/DLF/benchrepro0212: MiAaHDL | ||
| 583 | 1 | |a digitized |c 2020 |h HathiTrust Digital Library |l committed to preserve |2 pda |5 MiAaHDL | |
| 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 Formale Sprache |0 (DE-588)4017848-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Berechnungskomplexität |0 (DE-588)4134751-1 |2 gnd |9 rswk-swf |
| 653 | 0 | |a Machine theory | |
| 653 | 0 | |a Computational complexity | |
| 653 | 0 | |a Théorie des automates | |
| 653 | 0 | |a Complexité de calcul (Informatique) | |
| 653 | 0 | |a Computational complexity | |
| 653 | 0 | |a Machine theory | |
| 689 | 0 | 0 | |a Theoretische Informatik |0 (DE-588)4196735-5 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |D s |
| 689 | 1 | 1 | |a Berechnungskomplexität |0 (DE-588)4134751-1 |D s |
| 689 | 1 | |5 DE-604 | |
| 689 | 2 | 0 | |a Automatentheorie |0 (DE-588)4003953-5 |D s |
| 689 | 2 | 1 | |a Formale Sprache |0 (DE-588)4017848-1 |D s |
| 689 | 2 | |5 DE-604 | |
| 776 | 0 | 8 | |i Erscheint auch als |a Sipser, Michael |t Introduction to the theory of computation |b Third edition |d Boston, MA : Cengage Learning, [2013] |n Druck-Ausgabe |z 978-1-133-18779-0 |
| 912 | |a ZDB-4-NLEBK | ||
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-035243785 | |
| 966 | e | |u http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=2944095 |l DE-91 |p ZDB-4-NLEBK |q TUM_Einzelkauf_2024 |x Aggregator |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1822482921272901632 |
|---|---|
| adam_text | |
| any_adam_object | |
| author | Sipser, Michael |
| author_GND | (DE-588)131513176 |
| author_facet | Sipser, Michael |
| author_role | aut |
| author_sort | Sipser, Michael |
| author_variant | m s ms |
| building | Verbundindex |
| bvnumber | BV049904876 |
| classification_rvk | ST 130 ST 134 ST 136 |
| classification_tum | DAT 500 |
| collection | ZDB-4-NLEBK |
| contents | Automata and languages Regular languages Context-free languages -- Computability theory The Church-Turing thesis Decidability Reducibility Advanced topics in computability theory -- Complexity theory Time complexity Space complexity Intractability Advanced topics in complexity theory |
| ctrlnum | (OCoLC)1477596328 (DE-599)BVBBV049904876 |
| discipline | Informatik |
| edition | Third edition |
| format | Electronic eBook |
| 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">BV049904876</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20241107</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">241014s2013 xx a||| ob||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781285401065</subfield><subfield code="9">978-1-285-40106-5</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1285401069</subfield><subfield code="9">1285401069</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1477596328</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV049904876</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-91G</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 130</subfield><subfield code="0">(DE-625)143588:</subfield><subfield code="2">rvk</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="084" ind1=" " ind2=" "><subfield code="a">ST 136</subfield><subfield code="0">(DE-625)143591:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 500</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Sipser, Michael</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)131513176</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Introduction to the theory of computation</subfield><subfield code="c">Michael Sipser</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">Third edition</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Australia ; Brazil ; Japan ; Korea ; Mexico ; Singapore ; Spain ; United Kingdom ; United States</subfield><subfield code="b">Cengage Learning</subfield><subfield code="c">[2013]</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (xxii, 458 Seiten)</subfield><subfield code="b">Illustrationen</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="505" ind1="8" ind2="0"><subfield code="t">Automata and languages</subfield><subfield code="t">Regular languages</subfield><subfield code="t">Context-free languages --</subfield><subfield code="t">Computability theory</subfield><subfield code="t">The Church-Turing thesis</subfield><subfield code="t">Decidability</subfield><subfield code="t">Reducibility</subfield><subfield code="t">Advanced topics in computability theory --</subfield><subfield code="t">Complexity theory</subfield><subfield code="t">Time complexity</subfield><subfield code="t">Space complexity</subfield><subfield code="t">Intractability</subfield><subfield code="t">Advanced topics in complexity theory</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Gain a solid understanding of the fundamental mathematical properties of computer hardware, software, and applications with a blend of practical and philosophical coverage and mathematical treatments, including advanced theorems and proofs. This books comprehensive coverage makes it a valuable reference for studies in theoretical computing</subfield></datafield><datafield tag="538" ind1=" " ind2=" "><subfield code="a">Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002</subfield><subfield code="u">http://purl.oclc.org/DLF/benchrepro0212: MiAaHDL</subfield></datafield><datafield tag="583" ind1="1" ind2=" "><subfield code="a">digitized</subfield><subfield code="c">2020</subfield><subfield code="h">HathiTrust Digital Library</subfield><subfield code="l">committed to preserve</subfield><subfield code="2">pda</subfield><subfield code="5">MiAaHDL</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">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">Komplexitätstheorie</subfield><subfield code="0">(DE-588)4120591-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Berechnungskomplexität</subfield><subfield code="0">(DE-588)4134751-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Machine theory</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Computational complexity</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Théorie des automates</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Complexité de calcul (Informatique)</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Computational complexity</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Machine theory</subfield></datafield><datafield tag="689" ind1="0" 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="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Komplexitätstheorie</subfield><subfield code="0">(DE-588)4120591-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Berechnungskomplexität</subfield><subfield code="0">(DE-588)4134751-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" 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="2" ind2="1"><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="5">DE-604</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="a">Sipser, Michael</subfield><subfield code="t">Introduction to the theory of computation</subfield><subfield code="b">Third edition</subfield><subfield code="d">Boston, MA : Cengage Learning, [2013]</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">978-1-133-18779-0</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-4-NLEBK</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-035243785</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=2944095</subfield><subfield code="l">DE-91</subfield><subfield code="p">ZDB-4-NLEBK</subfield><subfield code="q">TUM_Einzelkauf_2024</subfield><subfield code="x">Aggregator</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV049904876 |
| illustrated | Illustrated |
| indexdate | 2025-01-28T09:05:53Z |
| institution | BVB |
| isbn | 9781285401065 1285401069 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-035243785 |
| oclc_num | 1477596328 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 1 Online-Ressource (xxii, 458 Seiten) Illustrationen |
| psigel | ZDB-4-NLEBK ZDB-4-NLEBK TUM_Einzelkauf_2024 |
| publishDate | 2013 |
| publishDateSearch | 2013 |
| publishDateSort | 2013 |
| publisher | Cengage Learning |
| record_format | marc |
| spelling | Sipser, Michael Verfasser (DE-588)131513176 aut Introduction to the theory of computation Michael Sipser Third edition Australia ; Brazil ; Japan ; Korea ; Mexico ; Singapore ; Spain ; United Kingdom ; United States Cengage Learning [2013] 1 Online-Ressource (xxii, 458 Seiten) Illustrationen txt rdacontent c rdamedia cr rdacarrier Automata and languages Regular languages Context-free languages -- Computability theory The Church-Turing thesis Decidability Reducibility Advanced topics in computability theory -- Complexity theory Time complexity Space complexity Intractability Advanced topics in complexity theory Gain a solid understanding of the fundamental mathematical properties of computer hardware, software, and applications with a blend of practical and philosophical coverage and mathematical treatments, including advanced theorems and proofs. This books comprehensive coverage makes it a valuable reference for studies in theoretical computing Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002 http://purl.oclc.org/DLF/benchrepro0212: MiAaHDL digitized 2020 HathiTrust Digital Library committed to preserve pda MiAaHDL Automatentheorie (DE-588)4003953-5 gnd rswk-swf Theoretische Informatik (DE-588)4196735-5 gnd rswk-swf Formale Sprache (DE-588)4017848-1 gnd rswk-swf Komplexitätstheorie (DE-588)4120591-1 gnd rswk-swf Berechnungskomplexität (DE-588)4134751-1 gnd rswk-swf Machine theory Computational complexity Théorie des automates Complexité de calcul (Informatique) Theoretische Informatik (DE-588)4196735-5 s DE-604 Komplexitätstheorie (DE-588)4120591-1 s Berechnungskomplexität (DE-588)4134751-1 s Automatentheorie (DE-588)4003953-5 s Formale Sprache (DE-588)4017848-1 s Erscheint auch als Sipser, Michael Introduction to the theory of computation Third edition Boston, MA : Cengage Learning, [2013] Druck-Ausgabe 978-1-133-18779-0 |
| spellingShingle | Sipser, Michael Introduction to the theory of computation Automata and languages Regular languages Context-free languages -- Computability theory The Church-Turing thesis Decidability Reducibility Advanced topics in computability theory -- Complexity theory Time complexity Space complexity Intractability Advanced topics in complexity theory Automatentheorie (DE-588)4003953-5 gnd Theoretische Informatik (DE-588)4196735-5 gnd Formale Sprache (DE-588)4017848-1 gnd Komplexitätstheorie (DE-588)4120591-1 gnd Berechnungskomplexität (DE-588)4134751-1 gnd |
| subject_GND | (DE-588)4003953-5 (DE-588)4196735-5 (DE-588)4017848-1 (DE-588)4120591-1 (DE-588)4134751-1 |
| title | Introduction to the theory of computation |
| title_alt | Automata and languages Regular languages Context-free languages -- Computability theory The Church-Turing thesis Decidability Reducibility Advanced topics in computability theory -- Complexity theory Time complexity Space complexity Intractability Advanced topics in complexity theory |
| title_auth | Introduction to the theory of computation |
| title_exact_search | Introduction to the theory of computation |
| title_full | Introduction to the theory of computation Michael Sipser |
| title_fullStr | Introduction to the theory of computation Michael Sipser |
| title_full_unstemmed | Introduction to the theory of computation Michael Sipser |
| title_short | Introduction to the theory of computation |
| title_sort | introduction to the theory of computation |
| topic | Automatentheorie (DE-588)4003953-5 gnd Theoretische Informatik (DE-588)4196735-5 gnd Formale Sprache (DE-588)4017848-1 gnd Komplexitätstheorie (DE-588)4120591-1 gnd Berechnungskomplexität (DE-588)4134751-1 gnd |
| topic_facet | Automatentheorie Theoretische Informatik Formale Sprache Komplexitätstheorie Berechnungskomplexität |
| work_keys_str_mv | AT sipsermichael introductiontothetheoryofcomputation |