Introduction to the theory of computation:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Boston, Mass.
Cengage Learning
2013
|
| Ausgabe: | Third edition |
| Schlagworte: | |
| Beschreibung: | Literaturverz. S. 443 - 447 |
| Beschreibung: | XXII, 458 Seiten graph. Darst. |
| ISBN: | 9780357670583 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV049648956 | ||
| 003 | DE-604 | ||
| 007 | t | ||
| 008 | 240415s2013 d||| |||| 00||| eng d | ||
| 020 | |a 9780357670583 |9 978-0-357-67058-3 | ||
| 035 | |a (OCoLC)1430766767 | ||
| 035 | |a (DE-599)BVBBV049648956 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-573 | ||
| 082 | 0 | |a 511.35 | |
| 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 54.10 |2 bkl | ||
| 084 | |a DAT 500f |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 Boston, Mass. |b Cengage Learning |c 2013 | |
| 300 | |a XXII, 458 Seiten |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 500 | |a Literaturverz. S. 443 - 447 | ||
| 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 |
| 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 | |
Datensatz im Suchindex
| _version_ | 1805071436564398080 |
|---|---|
| adam_text | |
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| 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 | BV049648956 |
| classification_rvk | ST 130 ST 134 ST 136 |
| classification_tum | DAT 500f |
| ctrlnum | (OCoLC)1430766767 (DE-599)BVBBV049648956 |
| dewey-full | 511.35 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511.35 |
| dewey-search | 511.35 |
| dewey-sort | 3511.35 |
| dewey-tens | 510 - Mathematics |
| discipline | Informatik Mathematik |
| discipline_str_mv | Informatik Mathematik |
| edition | Third 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">BV049648956</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">240415s2013 d||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780357670583</subfield><subfield code="9">978-0-357-67058-3</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1430766767</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV049648956</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-573</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.35</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">54.10</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 500f</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">Boston, Mass.</subfield><subfield code="b">Cengage Learning</subfield><subfield code="c">2013</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XXII, 458 Seiten</subfield><subfield code="b">graph. Darst.</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="500" ind1=" " ind2=" "><subfield code="a">Literaturverz. S. 443 - 447</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="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></record></collection> |
| id | DE-604.BV049648956 |
| illustrated | Illustrated |
| index_date | 2024-07-03T23:40:07Z |
| indexdate | 2024-07-20T04:37:48Z |
| institution | BVB |
| isbn | 9780357670583 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-034992434 |
| oclc_num | 1430766767 |
| open_access_boolean | |
| owner | DE-573 |
| owner_facet | DE-573 |
| physical | XXII, 458 Seiten graph. Darst. |
| 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 Boston, Mass. Cengage Learning 2013 XXII, 458 Seiten graph. Darst. txt rdacontent n rdamedia nc rdacarrier Literaturverz. S. 443 - 447 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 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 |
| spellingShingle | Sipser, Michael Introduction to the theory of computation 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_auth | Introduction to the theory of computation |
| title_exact_search | Introduction to the theory of computation |
| title_exact_search_txtP | 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 |