Introduction to the theory of computation:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Boston [u.a.]
PWS Publ.
1996
|
| Ausgabe: | Preliminary ed. |
| Schriftenreihe: | The PWS series in computer science
|
| Schlagworte: | |
| Beschreibung: | XII, 239 S. graph. Darst. |
| ISBN: | 053495250X |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV011100803 | ||
| 003 | DE-604 | ||
| 005 | 20031022 | ||
| 007 | t | ||
| 008 | 961205s1996 d||| |||| 00||| eng d | ||
| 020 | |a 053495250X |9 0-534-95250-X | ||
| 035 | |a (OCoLC)33012805 | ||
| 035 | |a (DE-599)BVBBV011100803 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-739 |a DE-634 | ||
| 050 | 0 | |a QA267 | |
| 082 | 0 | |a 511.3 |2 20 | |
| 084 | |a ST 130 |0 (DE-625)143588: |2 rvk | ||
| 100 | 1 | |a Sipser, Michael |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Introduction to the theory of computation |c Michael Sipser |
| 250 | |a Preliminary ed. | ||
| 264 | 1 | |a Boston [u.a.] |b PWS Publ. |c 1996 | |
| 300 | |a XII, 239 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 0 | |a The PWS series in computer science | |
| 650 | 4 | |a Computational complexity | |
| 650 | 4 | |a Machine theory | |
| 650 | 0 | 7 | |a Theoretische Informatik |0 (DE-588)4196735-5 |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 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 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 Automatentheorie |0 (DE-588)4003953-5 |D s |
| 689 | 1 | 1 | |a Formale Sprache |0 (DE-588)4017848-1 |D s |
| 689 | 1 | |8 1\p |5 DE-604 | |
| 689 | 2 | 0 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |D s |
| 689 | 2 | 1 | |a Berechnungskomplexität |0 (DE-588)4134751-1 |D s |
| 689 | 2 | |8 2\p |5 DE-604 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007436596 | ||
| 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 | |
Datensatz im Suchindex
| _version_ | 1804125590578528256 |
|---|---|
| any_adam_object | |
| author | Sipser, Michael |
| author_facet | Sipser, Michael |
| author_role | aut |
| author_sort | Sipser, Michael |
| author_variant | m s ms |
| building | Verbundindex |
| bvnumber | BV011100803 |
| callnumber-first | Q - Science |
| callnumber-label | QA267 |
| callnumber-raw | QA267 |
| callnumber-search | QA267 |
| callnumber-sort | QA 3267 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | ST 130 |
| ctrlnum | (OCoLC)33012805 (DE-599)BVBBV011100803 |
| 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 | Preliminary ed. |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01868nam a2200517 c 4500</leader><controlfield tag="001">BV011100803</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20031022 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">961205s1996 d||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">053495250X</subfield><subfield code="9">0-534-95250-X</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)33012805</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV011100803</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-739</subfield><subfield code="a">DE-634</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA267</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 130</subfield><subfield code="0">(DE-625)143588:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Sipser, Michael</subfield><subfield code="e">Verfasser</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">Preliminary ed.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Boston [u.a.]</subfield><subfield code="b">PWS Publ.</subfield><subfield code="c">1996</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XII, 239 S.</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="490" ind1="0" ind2=" "><subfield code="a">The PWS series in computer science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Machine theory</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">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">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">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">Automatentheorie</subfield><subfield code="0">(DE-588)4003953-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" 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="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" 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="2" 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="2" ind2=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007436596</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></record></collection> |
| id | DE-604.BV011100803 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T18:03:59Z |
| institution | BVB |
| isbn | 053495250X |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007436596 |
| oclc_num | 33012805 |
| open_access_boolean | |
| owner | DE-739 DE-634 |
| owner_facet | DE-739 DE-634 |
| physical | XII, 239 S. graph. Darst. |
| publishDate | 1996 |
| publishDateSearch | 1996 |
| publishDateSort | 1996 |
| publisher | PWS Publ. |
| record_format | marc |
| series2 | The PWS series in computer science |
| spelling | Sipser, Michael Verfasser aut Introduction to the theory of computation Michael Sipser Preliminary ed. Boston [u.a.] PWS Publ. 1996 XII, 239 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier The PWS series in computer science Computational complexity Machine theory Theoretische Informatik (DE-588)4196735-5 gnd rswk-swf Komplexitätstheorie (DE-588)4120591-1 gnd rswk-swf Formale Sprache (DE-588)4017848-1 gnd rswk-swf Automatentheorie (DE-588)4003953-5 gnd rswk-swf Berechnungskomplexität (DE-588)4134751-1 gnd rswk-swf Theoretische Informatik (DE-588)4196735-5 s DE-604 Automatentheorie (DE-588)4003953-5 s Formale Sprache (DE-588)4017848-1 s 1\p DE-604 Komplexitätstheorie (DE-588)4120591-1 s Berechnungskomplexität (DE-588)4134751-1 s 2\p DE-604 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 |
| spellingShingle | Sipser, Michael Introduction to the theory of computation Computational complexity Machine theory Theoretische Informatik (DE-588)4196735-5 gnd Komplexitätstheorie (DE-588)4120591-1 gnd Formale Sprache (DE-588)4017848-1 gnd Automatentheorie (DE-588)4003953-5 gnd Berechnungskomplexität (DE-588)4134751-1 gnd |
| subject_GND | (DE-588)4196735-5 (DE-588)4120591-1 (DE-588)4017848-1 (DE-588)4003953-5 (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_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 | Computational complexity Machine theory Theoretische Informatik (DE-588)4196735-5 gnd Komplexitätstheorie (DE-588)4120591-1 gnd Formale Sprache (DE-588)4017848-1 gnd Automatentheorie (DE-588)4003953-5 gnd Berechnungskomplexität (DE-588)4134751-1 gnd |
| topic_facet | Computational complexity Machine theory Theoretische Informatik Komplexitätstheorie Formale Sprache Automatentheorie Berechnungskomplexität |
| work_keys_str_mv | AT sipsermichael introductiontothetheoryofcomputation |