Elements of the theory of computation:
Gespeichert in:
| Beteiligte Personen: | , |
|---|---|
| Format: | Buch |
| Sprache: | Englisch |
| Veröffentlicht: |
Englewood Cliffs, N.J.
Prentice-Hall
1981
|
| Schriftenreihe: | Prentice-Hall software series.
|
| Schlagwörter: | |
| Umfang: | XIV, 466 S. graph.Darst. |
| ISBN: | 0132734176 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV002143951 | ||
| 003 | DE-604 | ||
| 005 | 19980213 | ||
| 007 | t| | ||
| 008 | 890928s1981 xx d||| |||| 00||| eng d | ||
| 020 | |a 0132734176 |9 0-13-273417-6 | ||
| 035 | |a (OCoLC)299372519 | ||
| 035 | |a (DE-599)BVBBV002143951 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G |a DE-384 |a DE-473 |a DE-739 |a DE-20 |a DE-29T |a DE-19 |a DE-634 |a DE-83 |a DE-11 |a DE-188 | ||
| 050 | 0 | |a QA267L49 1981 | |
| 082 | 0 | |a 511 |2 19 | |
| 084 | |a ST 130 |0 (DE-625)143588: |2 rvk | ||
| 100 | 1 | |a Lewis, Harry R. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Elements of the theory of computation |c Harry R. Lewis ; Christos H. Papadimitriou |
| 264 | 1 | |a Englewood Cliffs, N.J. |b Prentice-Hall |c 1981 | |
| 300 | |a XIV, 466 S. |b graph.Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 0 | |a Prentice-Hall software series. | |
| 650 | 4 | |a Complexité de calcul (Informatique) | |
| 650 | 7 | |a Complexité de calcul (informatique) |2 ram | |
| 650 | 7 | |a Fonctions calculables |2 ram | |
| 650 | 4 | |a Langages formels | |
| 650 | 7 | |a Langages formels |2 ram | |
| 650 | 4 | |a Logique symbolique et mathématique | |
| 650 | 7 | |a Logique symbolique et mathématique |2 ram | |
| 650 | 4 | |a Théorie des automates | |
| 650 | 7 | |a automate fini |2 inriac | |
| 650 | 7 | |a calcul propositionnel |2 inriac | |
| 650 | 7 | |a calcul prédicat |2 inriac | |
| 650 | 7 | |a complexité calcul |2 inriac | |
| 650 | 7 | |a langage algébrique |2 inriac | |
| 650 | 7 | |a langage formel |2 inriac | |
| 650 | 7 | |a logique mathématique |2 inriac | |
| 650 | 7 | |a logique symbolique |2 inriac | |
| 650 | 7 | |a machine Turing |2 inriac | |
| 650 | 7 | |a thèse Church |2 inriac | |
| 650 | 7 | |a théorie calcul |2 inriac | |
| 650 | 0 | 7 | |a Berechenbarkeit |0 (DE-588)4138368-0 |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 Automatentheorie |0 (DE-588)4003953-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 Mathematische Logik |0 (DE-588)4037951-6 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Automatentheorie |0 (DE-588)4003953-5 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Mathematische Logik |0 (DE-588)4037951-6 |D s |
| 689 | 1 | 1 | |a Formale Sprache |0 (DE-588)4017848-1 |D s |
| 689 | 1 | |5 DE-604 | |
| 689 | 2 | 0 | |a Berechenbarkeit |0 (DE-588)4138368-0 |D s |
| 689 | 2 | |5 DE-604 | |
| 689 | 3 | 0 | |a Theoretische Informatik |0 (DE-588)4196735-5 |D s |
| 689 | 3 | |8 1\p |5 DE-604 | |
| 689 | 4 | 0 | |a Berechenbarkeit |0 (DE-588)4138368-0 |D s |
| 689 | 4 | |5 DE-604 | |
| 700 | 1 | |a Papadimitriou, Christos H. |d 1949- |e Verfasser |0 (DE-588)135731909 |4 aut | |
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-001406400 | |
Datensatz im Suchindex
| DE-BY-TUM_call_number | 0102 DAT 500f 2001 A 22710 |
|---|---|
| DE-BY-TUM_katkey | 288542 |
| DE-BY-TUM_location | 01 |
| DE-BY-TUM_media_number | 040020546689 |
| _version_ | 1821934345924902912 |
| any_adam_object | |
| author | Lewis, Harry R. Papadimitriou, Christos H. 1949- |
| author_GND | (DE-588)135731909 |
| author_facet | Lewis, Harry R. Papadimitriou, Christos H. 1949- |
| author_role | aut aut |
| author_sort | Lewis, Harry R. |
| author_variant | h r l hr hrl c h p ch chp |
| building | Verbundindex |
| bvnumber | BV002143951 |
| callnumber-first | Q - Science |
| callnumber-label | QA267L49 1981 |
| callnumber-raw | QA267L49 1981 |
| callnumber-search | QA267L49 1981 |
| callnumber-sort | QA 3267 L49 41981 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | ST 130 |
| ctrlnum | (OCoLC)299372519 (DE-599)BVBBV002143951 |
| dewey-full | 511 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511 |
| dewey-search | 511 |
| dewey-sort | 3511 |
| dewey-tens | 510 - Mathematics |
| discipline | Informatik Mathematik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02774nam a2200745 c 4500</leader><controlfield tag="001">BV002143951</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19980213 </controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">890928s1981 xx d||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0132734176</subfield><subfield code="9">0-13-273417-6</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)299372519</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV002143951</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-91G</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-473</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-29T</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-188</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA267L49 1981</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511</subfield><subfield code="2">19</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">Lewis, Harry R.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Elements of the theory of computation</subfield><subfield code="c">Harry R. Lewis ; Christos H. Papadimitriou</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Englewood Cliffs, N.J.</subfield><subfield code="b">Prentice-Hall</subfield><subfield code="c">1981</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XIV, 466 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">Prentice-Hall software series.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Complexité de calcul (Informatique)</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Complexité de calcul (informatique)</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Fonctions calculables</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Langages formels</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Langages formels</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Logique symbolique et mathématique</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Logique symbolique et mathématique</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Théorie des automates</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">automate fini</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">calcul propositionnel</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">calcul prédicat</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">complexité calcul</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">langage algébrique</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">langage formel</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">logique mathématique</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">logique symbolique</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">machine Turing</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">thèse Church</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">théorie calcul</subfield><subfield code="2">inriac</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="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">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">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">Mathematische Logik</subfield><subfield code="0">(DE-588)4037951-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" 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="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Mathematische Logik</subfield><subfield code="0">(DE-588)4037951-6</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="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" 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="2" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="3" 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="3" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="4" 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="4" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Papadimitriou, Christos H.</subfield><subfield code="d">1949-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)135731909</subfield><subfield code="4">aut</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="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-001406400</subfield></datafield></record></collection> |
| id | DE-604.BV002143951 |
| illustrated | Illustrated |
| indexdate | 2024-12-20T07:46:41Z |
| institution | BVB |
| isbn | 0132734176 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-001406400 |
| oclc_num | 299372519 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM DE-384 DE-473 DE-BY-UBG DE-739 DE-20 DE-29T DE-19 DE-BY-UBM DE-634 DE-83 DE-11 DE-188 |
| owner_facet | DE-91G DE-BY-TUM DE-384 DE-473 DE-BY-UBG DE-739 DE-20 DE-29T DE-19 DE-BY-UBM DE-634 DE-83 DE-11 DE-188 |
| physical | XIV, 466 S. graph.Darst. |
| publishDate | 1981 |
| publishDateSearch | 1981 |
| publishDateSort | 1981 |
| publisher | Prentice-Hall |
| record_format | marc |
| series2 | Prentice-Hall software series. |
| spellingShingle | Lewis, Harry R. Papadimitriou, Christos H. 1949- Elements of the theory of computation Complexité de calcul (Informatique) Complexité de calcul (informatique) ram Fonctions calculables ram Langages formels Langages formels ram Logique symbolique et mathématique Logique symbolique et mathématique ram Théorie des automates automate fini inriac calcul propositionnel inriac calcul prédicat inriac complexité calcul inriac langage algébrique inriac langage formel inriac logique mathématique inriac logique symbolique inriac machine Turing inriac thèse Church inriac théorie calcul inriac Berechenbarkeit (DE-588)4138368-0 gnd Theoretische Informatik (DE-588)4196735-5 gnd Automatentheorie (DE-588)4003953-5 gnd Formale Sprache (DE-588)4017848-1 gnd Mathematische Logik (DE-588)4037951-6 gnd |
| subject_GND | (DE-588)4138368-0 (DE-588)4196735-5 (DE-588)4003953-5 (DE-588)4017848-1 (DE-588)4037951-6 |
| title | Elements of the theory of computation |
| title_auth | Elements of the theory of computation |
| title_exact_search | Elements of the theory of computation |
| title_full | Elements of the theory of computation Harry R. Lewis ; Christos H. Papadimitriou |
| title_fullStr | Elements of the theory of computation Harry R. Lewis ; Christos H. Papadimitriou |
| title_full_unstemmed | Elements of the theory of computation Harry R. Lewis ; Christos H. Papadimitriou |
| title_short | Elements of the theory of computation |
| title_sort | elements of the theory of computation |
| topic | Complexité de calcul (Informatique) Complexité de calcul (informatique) ram Fonctions calculables ram Langages formels Langages formels ram Logique symbolique et mathématique Logique symbolique et mathématique ram Théorie des automates automate fini inriac calcul propositionnel inriac calcul prédicat inriac complexité calcul inriac langage algébrique inriac langage formel inriac logique mathématique inriac logique symbolique inriac machine Turing inriac thèse Church inriac théorie calcul inriac Berechenbarkeit (DE-588)4138368-0 gnd Theoretische Informatik (DE-588)4196735-5 gnd Automatentheorie (DE-588)4003953-5 gnd Formale Sprache (DE-588)4017848-1 gnd Mathematische Logik (DE-588)4037951-6 gnd |
| topic_facet | Complexité de calcul (Informatique) Complexité de calcul (informatique) Fonctions calculables Langages formels Logique symbolique et mathématique Théorie des automates automate fini calcul propositionnel calcul prédicat complexité calcul langage algébrique langage formel logique mathématique logique symbolique machine Turing thèse Church théorie calcul Berechenbarkeit Theoretische Informatik Automatentheorie Formale Sprache Mathematische Logik |
| work_keys_str_mv | AT lewisharryr elementsofthetheoryofcomputation AT papadimitriouchristosh elementsofthetheoryofcomputation |
Paper/Kapitel scannen lassen
Teilbibliothek Mathematik & Informatik
| Signatur: |
0102 DAT 500f 2001 A 22710 Lageplan |
|---|---|
| Exemplar 1 | Ausleihbar Am Standort |