Introduction to automata theory, languages, and computation:
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Boston ; Munich [u.a.]
Pearson/Addison Wesley
2007
|
| Ausgabe: | 3. ed. |
| Schlagworte: | |
| Beschreibung: | XVII, 535 S. graph. Darst. 1 student access kit |
| ISBN: | 0321455363 0321455371 |
Internformat
MARC
| LEADER | 00000nam a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV035365711 | ||
| 003 | DE-604 | ||
| 005 | 20090319 | ||
| 007 | t | ||
| 008 | 090312s2007 xxud||| |||| 00||| eng d | ||
| 020 | |a 0321455363 |9 0-321-45536-3 | ||
| 020 | |a 0321455371 |c student access kit |9 0-321-45537-1 | ||
| 035 | |a (OCoLC)69013079 | ||
| 035 | |a (DE-599)BVBBV035365711 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 044 | |a xxu |c US | ||
| 049 | |a DE-91G | ||
| 050 | 0 | |a QA267 | |
| 082 | 0 | |a 511.3/5 | |
| 084 | |a ST 130 |0 (DE-625)143588: |2 rvk | ||
| 084 | |a DAT 550f |2 stub | ||
| 084 | |a DAT 555f |2 stub | ||
| 084 | |a DAT 517f |2 stub | ||
| 084 | |a DAT 500f |2 stub | ||
| 100 | 1 | |a Hopcroft, John E. |d 1939- |e Verfasser |0 (DE-588)112071481 |4 aut | |
| 245 | 1 | 0 | |a Introduction to automata theory, languages, and computation |c John E. Hopcroft ; Rajeev Motwani ; Jeffrey D. Ullman |
| 250 | |a 3. ed. | ||
| 264 | 1 | |a Boston ; Munich [u.a.] |b Pearson/Addison Wesley |c 2007 | |
| 300 | |a XVII, 535 S. |b graph. Darst. |e 1 student access kit | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 650 | 4 | |a Automates mathématiques, Théorie des | |
| 650 | 4 | |a Complexité de calcul (Informatique) | |
| 650 | 4 | |a Langages formels | |
| 650 | 4 | |a Machine theory | |
| 650 | 4 | |a Formal languages | |
| 650 | 4 | |a Computational complexity | |
| 650 | 0 | 7 | |a Automatentheorie |0 (DE-588)4003953-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 Berechenbarkeit |0 (DE-588)4138368-0 |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 Theoretische Informatik |0 (DE-588)4196735-5 |2 gnd |9 rswk-swf |
| 655 | 7 | |8 1\p |0 (DE-588)4123623-3 |a Lehrbuch |2 gnd-content | |
| 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 | 2 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |D s |
| 689 | 1 | 3 | |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 | |5 DE-604 | |
| 689 | 3 | 0 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |D s |
| 689 | 3 | |5 DE-604 | |
| 700 | 1 | |a Motwani, Rajeev |d 1962-2009 |e Verfasser |0 (DE-588)124195199 |4 aut | |
| 700 | 1 | |a Ullman, Jeffrey D. |d 1942- |e Verfasser |0 (DE-588)123598230 |4 aut | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-017169687 | ||
| 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_ | 1804138691771236352 |
|---|---|
| any_adam_object | |
| author | Hopcroft, John E. 1939- Motwani, Rajeev 1962-2009 Ullman, Jeffrey D. 1942- |
| author_GND | (DE-588)112071481 (DE-588)124195199 (DE-588)123598230 |
| author_facet | Hopcroft, John E. 1939- Motwani, Rajeev 1962-2009 Ullman, Jeffrey D. 1942- |
| author_role | aut aut aut |
| author_sort | Hopcroft, John E. 1939- |
| author_variant | j e h je jeh r m rm j d u jd jdu |
| building | Verbundindex |
| bvnumber | BV035365711 |
| 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 |
| classification_tum | DAT 550f DAT 555f DAT 517f DAT 500f |
| ctrlnum | (OCoLC)69013079 (DE-599)BVBBV035365711 |
| dewey-full | 511.3/5 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511.3/5 |
| dewey-search | 511.3/5 |
| dewey-sort | 3511.3 15 |
| dewey-tens | 510 - Mathematics |
| discipline | Informatik Mathematik |
| edition | 3. ed. |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02638nam a2200697zc 4500</leader><controlfield tag="001">BV035365711</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20090319 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">090312s2007 xxud||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0321455363</subfield><subfield code="9">0-321-45536-3</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0321455371</subfield><subfield code="c">student access kit</subfield><subfield code="9">0-321-45537-1</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)69013079</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV035365711</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="044" ind1=" " ind2=" "><subfield code="a">xxu</subfield><subfield code="c">US</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</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/5</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">DAT 550f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 555f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 517f</subfield><subfield code="2">stub</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">Hopcroft, John E.</subfield><subfield code="d">1939-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)112071481</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Introduction to automata theory, languages, and computation</subfield><subfield code="c">John E. Hopcroft ; Rajeev Motwani ; Jeffrey D. Ullman</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">3. ed.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Boston ; Munich [u.a.]</subfield><subfield code="b">Pearson/Addison Wesley</subfield><subfield code="c">2007</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XVII, 535 S.</subfield><subfield code="b">graph. Darst.</subfield><subfield code="e">1 student access kit</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="650" ind1=" " ind2="4"><subfield code="a">Automates mathématiques, Théorie des</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Complexité de calcul (Informatique)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Langages formels</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Machine theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Formal languages</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</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">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">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">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">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="655" ind1=" " ind2="7"><subfield code="8">1\p</subfield><subfield code="0">(DE-588)4123623-3</subfield><subfield code="a">Lehrbuch</subfield><subfield code="2">gnd-content</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="2"><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="3"><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="5">DE-604</subfield></datafield><datafield tag="689" ind1="3" 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="3" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Motwani, Rajeev</subfield><subfield code="d">1962-2009</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)124195199</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Ullman, Jeffrey D.</subfield><subfield code="d">1942-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)123598230</subfield><subfield code="4">aut</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-017169687</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> |
| genre | 1\p (DE-588)4123623-3 Lehrbuch gnd-content |
| genre_facet | Lehrbuch |
| id | DE-604.BV035365711 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T21:32:13Z |
| institution | BVB |
| isbn | 0321455363 0321455371 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-017169687 |
| oclc_num | 69013079 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | XVII, 535 S. graph. Darst. 1 student access kit |
| publishDate | 2007 |
| publishDateSearch | 2007 |
| publishDateSort | 2007 |
| publisher | Pearson/Addison Wesley |
| record_format | marc |
| spelling | Hopcroft, John E. 1939- Verfasser (DE-588)112071481 aut Introduction to automata theory, languages, and computation John E. Hopcroft ; Rajeev Motwani ; Jeffrey D. Ullman 3. ed. Boston ; Munich [u.a.] Pearson/Addison Wesley 2007 XVII, 535 S. graph. Darst. 1 student access kit txt rdacontent n rdamedia nc rdacarrier Automates mathématiques, Théorie des Complexité de calcul (Informatique) Langages formels Machine theory Formal languages Computational complexity Automatentheorie (DE-588)4003953-5 gnd rswk-swf Komplexitätstheorie (DE-588)4120591-1 gnd rswk-swf Berechenbarkeit (DE-588)4138368-0 gnd rswk-swf Formale Sprache (DE-588)4017848-1 gnd rswk-swf Theoretische Informatik (DE-588)4196735-5 gnd rswk-swf 1\p (DE-588)4123623-3 Lehrbuch gnd-content Theoretische Informatik (DE-588)4196735-5 s DE-604 Automatentheorie (DE-588)4003953-5 s Formale Sprache (DE-588)4017848-1 s Komplexitätstheorie (DE-588)4120591-1 s Berechenbarkeit (DE-588)4138368-0 s 2\p DE-604 Motwani, Rajeev 1962-2009 Verfasser (DE-588)124195199 aut Ullman, Jeffrey D. 1942- Verfasser (DE-588)123598230 aut 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 | Hopcroft, John E. 1939- Motwani, Rajeev 1962-2009 Ullman, Jeffrey D. 1942- Introduction to automata theory, languages, and computation Automates mathématiques, Théorie des Complexité de calcul (Informatique) Langages formels Machine theory Formal languages Computational complexity Automatentheorie (DE-588)4003953-5 gnd Komplexitätstheorie (DE-588)4120591-1 gnd Berechenbarkeit (DE-588)4138368-0 gnd Formale Sprache (DE-588)4017848-1 gnd Theoretische Informatik (DE-588)4196735-5 gnd |
| subject_GND | (DE-588)4003953-5 (DE-588)4120591-1 (DE-588)4138368-0 (DE-588)4017848-1 (DE-588)4196735-5 (DE-588)4123623-3 |
| title | Introduction to automata theory, languages, and computation |
| title_auth | Introduction to automata theory, languages, and computation |
| title_exact_search | Introduction to automata theory, languages, and computation |
| title_full | Introduction to automata theory, languages, and computation John E. Hopcroft ; Rajeev Motwani ; Jeffrey D. Ullman |
| title_fullStr | Introduction to automata theory, languages, and computation John E. Hopcroft ; Rajeev Motwani ; Jeffrey D. Ullman |
| title_full_unstemmed | Introduction to automata theory, languages, and computation John E. Hopcroft ; Rajeev Motwani ; Jeffrey D. Ullman |
| title_short | Introduction to automata theory, languages, and computation |
| title_sort | introduction to automata theory languages and computation |
| topic | Automates mathématiques, Théorie des Complexité de calcul (Informatique) Langages formels Machine theory Formal languages Computational complexity Automatentheorie (DE-588)4003953-5 gnd Komplexitätstheorie (DE-588)4120591-1 gnd Berechenbarkeit (DE-588)4138368-0 gnd Formale Sprache (DE-588)4017848-1 gnd Theoretische Informatik (DE-588)4196735-5 gnd |
| topic_facet | Automates mathématiques, Théorie des Complexité de calcul (Informatique) Langages formels Machine theory Formal languages Computational complexity Automatentheorie Komplexitätstheorie Berechenbarkeit Formale Sprache Theoretische Informatik Lehrbuch |
| work_keys_str_mv | AT hopcroftjohne introductiontoautomatatheorylanguagesandcomputation AT motwanirajeev introductiontoautomatatheorylanguagesandcomputation AT ullmanjeffreyd introductiontoautomatatheorylanguagesandcomputation |