Einführung in die Automatentheorie, formale Sprachen und Komplexitätstheorie:
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | German |
| Veröffentlicht: |
Bonn [u.a.]
Addison-Wesley
1990
|
| Ausgabe: | 2. Aufl. |
| Schriftenreihe: | Internationale Computer-Bibliothek
|
| Schlagworte: | |
| Beschreibung: | 461 S. graph. Darst. |
| ISBN: | 389319181X |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV002772781 | ||
| 003 | DE-604 | ||
| 005 | 20100322 | ||
| 007 | t | ||
| 008 | 900618s1990 d||| |||| 00||| ger d | ||
| 020 | |a 389319181X |9 3-89319-181-X | ||
| 035 | |a (OCoLC)248552971 | ||
| 035 | |a (DE-599)BVBBV002772781 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a ger | |
| 049 | |a DE-91G |a DE-91 |a DE-384 |a DE-861 |a DE-19 |a DE-706 |a DE-83 |a DE-188 | ||
| 084 | |a ST 130 |0 (DE-625)143588: |2 rvk | ||
| 084 | |a ST 136 |0 (DE-625)143591: |2 rvk | ||
| 084 | |a DAT 500f |2 stub | ||
| 084 | |a DAT 550f |2 stub | ||
| 084 | |a DAT 630f |2 stub | ||
| 100 | 1 | |a Hopcroft, John E. |d 1939- |e Verfasser |0 (DE-588)112071481 |4 aut | |
| 240 | 1 | 0 | |a Introduction to automata theory, languages and computation |
| 245 | 1 | 0 | |a Einführung in die Automatentheorie, formale Sprachen und Komplexitätstheorie |c John E. Hopcroft ; Jeffrey D. Ullman |
| 250 | |a 2. Aufl. | ||
| 264 | 1 | |a Bonn [u.a.] |b Addison-Wesley |c 1990 | |
| 300 | |a 461 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 0 | |a Internationale Computer-Bibliothek | |
| 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 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 |
| 655 | 7 | |0 (DE-588)4123623-3 |a Lehrbuch |2 gnd-content | |
| 689 | 0 | 0 | |a Automatentheorie |0 (DE-588)4003953-5 |D s |
| 689 | 0 | 1 | |a Formale Sprache |0 (DE-588)4017848-1 |D s |
| 689 | 0 | 2 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |D s |
| 689 | 0 | 3 | |a Berechenbarkeit |0 (DE-588)4138368-0 |D s |
| 689 | 0 | |8 1\p |5 DE-604 | |
| 689 | 1 | 0 | |a Theoretische Informatik |0 (DE-588)4196735-5 |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 | |
| 700 | 1 | |a Ullman, Jeffrey D. |d 1942- |e Verfasser |0 (DE-588)123598230 |4 aut | |
| 700 | 1 | |a Carthaus, Ulrich |e Sonstige |4 oth | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-001770347 | ||
| 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_ | 1804117122022899712 |
|---|---|
| any_adam_object | |
| author | Hopcroft, John E. 1939- Ullman, Jeffrey D. 1942- |
| author_GND | (DE-588)112071481 (DE-588)123598230 |
| author_facet | Hopcroft, John E. 1939- Ullman, Jeffrey D. 1942- |
| author_role | aut aut |
| author_sort | Hopcroft, John E. 1939- |
| author_variant | j e h je jeh j d u jd jdu |
| building | Verbundindex |
| bvnumber | BV002772781 |
| classification_rvk | ST 130 ST 136 |
| classification_tum | DAT 500f DAT 550f DAT 630f |
| ctrlnum | (OCoLC)248552971 (DE-599)BVBBV002772781 |
| discipline | Informatik |
| edition | 2. Aufl. |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02301nam a2200577 c 4500</leader><controlfield tag="001">BV002772781</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20100322 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">900618s1990 d||| |||| 00||| ger d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">389319181X</subfield><subfield code="9">3-89319-181-X</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)248552971</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV002772781</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">ger</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield><subfield code="a">DE-91</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-861</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-188</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 136</subfield><subfield code="0">(DE-625)143591:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 500f</subfield><subfield code="2">stub</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 630f</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="240" ind1="1" ind2="0"><subfield code="a">Introduction to automata theory, languages and computation</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Einführung in die Automatentheorie, formale Sprachen und Komplexitätstheorie</subfield><subfield code="c">John E. Hopcroft ; Jeffrey D. Ullman</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">2. Aufl.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Bonn [u.a.]</subfield><subfield code="b">Addison-Wesley</subfield><subfield code="c">1990</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">461 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">Internationale Computer-Bibliothek</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">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="655" ind1=" " ind2="7"><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">Automatentheorie</subfield><subfield code="0">(DE-588)4003953-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" 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="0" 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="0" 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="0" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" 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="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="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="700" ind1="1" ind2=" "><subfield code="a">Carthaus, Ulrich</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-001770347</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 | (DE-588)4123623-3 Lehrbuch gnd-content |
| genre_facet | Lehrbuch |
| id | DE-604.BV002772781 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T15:49:23Z |
| institution | BVB |
| isbn | 389319181X |
| language | German |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-001770347 |
| oclc_num | 248552971 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM DE-91 DE-BY-TUM DE-384 DE-861 DE-19 DE-BY-UBM DE-706 DE-83 DE-188 |
| owner_facet | DE-91G DE-BY-TUM DE-91 DE-BY-TUM DE-384 DE-861 DE-19 DE-BY-UBM DE-706 DE-83 DE-188 |
| physical | 461 S. graph. Darst. |
| publishDate | 1990 |
| publishDateSearch | 1990 |
| publishDateSort | 1990 |
| publisher | Addison-Wesley |
| record_format | marc |
| series2 | Internationale Computer-Bibliothek |
| spelling | Hopcroft, John E. 1939- Verfasser (DE-588)112071481 aut Introduction to automata theory, languages and computation Einführung in die Automatentheorie, formale Sprachen und Komplexitätstheorie John E. Hopcroft ; Jeffrey D. Ullman 2. Aufl. Bonn [u.a.] Addison-Wesley 1990 461 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Internationale Computer-Bibliothek Berechenbarkeit (DE-588)4138368-0 gnd rswk-swf Theoretische Informatik (DE-588)4196735-5 gnd rswk-swf Automatentheorie (DE-588)4003953-5 gnd rswk-swf Komplexitätstheorie (DE-588)4120591-1 gnd rswk-swf Formale Sprache (DE-588)4017848-1 gnd rswk-swf (DE-588)4123623-3 Lehrbuch gnd-content 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 1\p DE-604 Theoretische Informatik (DE-588)4196735-5 s 2\p DE-604 DE-604 Ullman, Jeffrey D. 1942- Verfasser (DE-588)123598230 aut Carthaus, Ulrich Sonstige oth 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- Ullman, Jeffrey D. 1942- Einführung in die Automatentheorie, formale Sprachen und Komplexitätstheorie Berechenbarkeit (DE-588)4138368-0 gnd Theoretische Informatik (DE-588)4196735-5 gnd Automatentheorie (DE-588)4003953-5 gnd Komplexitätstheorie (DE-588)4120591-1 gnd Formale Sprache (DE-588)4017848-1 gnd |
| subject_GND | (DE-588)4138368-0 (DE-588)4196735-5 (DE-588)4003953-5 (DE-588)4120591-1 (DE-588)4017848-1 (DE-588)4123623-3 |
| title | Einführung in die Automatentheorie, formale Sprachen und Komplexitätstheorie |
| title_alt | Introduction to automata theory, languages and computation |
| title_auth | Einführung in die Automatentheorie, formale Sprachen und Komplexitätstheorie |
| title_exact_search | Einführung in die Automatentheorie, formale Sprachen und Komplexitätstheorie |
| title_full | Einführung in die Automatentheorie, formale Sprachen und Komplexitätstheorie John E. Hopcroft ; Jeffrey D. Ullman |
| title_fullStr | Einführung in die Automatentheorie, formale Sprachen und Komplexitätstheorie John E. Hopcroft ; Jeffrey D. Ullman |
| title_full_unstemmed | Einführung in die Automatentheorie, formale Sprachen und Komplexitätstheorie John E. Hopcroft ; Jeffrey D. Ullman |
| title_short | Einführung in die Automatentheorie, formale Sprachen und Komplexitätstheorie |
| title_sort | einfuhrung in die automatentheorie formale sprachen und komplexitatstheorie |
| topic | Berechenbarkeit (DE-588)4138368-0 gnd Theoretische Informatik (DE-588)4196735-5 gnd Automatentheorie (DE-588)4003953-5 gnd Komplexitätstheorie (DE-588)4120591-1 gnd Formale Sprache (DE-588)4017848-1 gnd |
| topic_facet | Berechenbarkeit Theoretische Informatik Automatentheorie Komplexitätstheorie Formale Sprache Lehrbuch |
| work_keys_str_mv | AT hopcroftjohne introductiontoautomatatheorylanguagesandcomputation AT ullmanjeffreyd introductiontoautomatatheorylanguagesandcomputation AT carthausulrich introductiontoautomatatheorylanguagesandcomputation AT hopcroftjohne einfuhrungindieautomatentheorieformalesprachenundkomplexitatstheorie AT ullmanjeffreyd einfuhrungindieautomatentheorieformalesprachenundkomplexitatstheorie AT carthausulrich einfuhrungindieautomatentheorieformalesprachenundkomplexitatstheorie |