Einführung in die Automatentheorie, formale Sprachen und Komplexitätstheorie:
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Book |
| Language: | German |
| Published: |
Bonn [u.a.]
Addison-Wesley
1992
|
| Edition: | 2. Aufl., 1. Nachdr. |
| Series: | Internationale Computer-Bibliothek
|
| Subjects: | |
| Online Access: | Inhaltsverzeichnis |
| Physical Description: | IX, 461 S. Ill. |
| ISBN: | 389319181X 020102988X |
Staff View
MARC
| LEADER | 00000nam a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV023783488 | ||
| 003 | DE-604 | ||
| 005 | 20101213 | ||
| 007 | t | ||
| 008 | 930125s1992 a||| |||| 00||| ger d | ||
| 020 | |a 389319181X |9 3-89319-181-X | ||
| 020 | |a 020102988X |9 0-201-02988-X | ||
| 035 | |a (OCoLC)231388276 | ||
| 035 | |a (DE-599)BVBBV023783488 | ||
| 040 | |a DE-604 |b ger | ||
| 041 | 0 | |a ger | |
| 049 | |a DE-83 |a DE-11 | ||
| 084 | |a ST 130 |0 (DE-625)143588: |2 rvk | ||
| 084 | |a ST 136 |0 (DE-625)143591: |2 rvk | ||
| 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., 1. Nachdr. | ||
| 264 | 1 | |a Bonn [u.a.] |b Addison-Wesley |c 1992 | |
| 300 | |a IX, 461 S. |b Ill. | ||
| 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 Komplexitätstheorie |0 (DE-588)4120591-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 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 Berechenbarkeit |0 (DE-588)4138368-0 |2 gnd |9 rswk-swf |
| 655 | 7 | |8 1\p |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 2\p |5 DE-604 | |
| 689 | 1 | 0 | |a Theoretische Informatik |0 (DE-588)4196735-5 |D s |
| 689 | 1 | |8 3\p |5 DE-604 | |
| 700 | 1 | |a Ullman, Jeffrey D. |d 1942- |e Verfasser |0 (DE-588)123598230 |4 aut | |
| 856 | 4 | |u http://www3.ub.tu-berlin.de/ihv/000137570.pdf |3 Inhaltsverzeichnis | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-017425699 | ||
| 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 | |
| 883 | 1 | |8 3\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
Record in the Search Index
| _version_ | 1804138975119540224 |
|---|---|
| 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 | BV023783488 |
| classification_rvk | ST 130 ST 136 |
| ctrlnum | (OCoLC)231388276 (DE-599)BVBBV023783488 |
| discipline | Informatik |
| edition | 2. Aufl., 1. Nachdr. |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02250nam a2200541zc 4500</leader><controlfield tag="001">BV023783488</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20101213 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">930125s1992 a||| |||| 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="020" ind1=" " ind2=" "><subfield code="a">020102988X</subfield><subfield code="9">0-201-02988-X</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)231388276</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV023783488</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">ger</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-83</subfield><subfield code="a">DE-11</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="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., 1. Nachdr.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Bonn [u.a.]</subfield><subfield code="b">Addison-Wesley</subfield><subfield code="c">1992</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">IX, 461 S.</subfield><subfield code="b">Ill.</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">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">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">Berechenbarkeit</subfield><subfield code="0">(DE-588)4138368-0</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">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">2\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">3\p</subfield><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="856" ind1="4" ind2=" "><subfield code="u">http://www3.ub.tu-berlin.de/ihv/000137570.pdf</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-017425699</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><datafield tag="883" ind1="1" ind2=" "><subfield code="8">3\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.BV023783488 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T21:36:43Z |
| institution | BVB |
| isbn | 389319181X 020102988X |
| language | German |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-017425699 |
| oclc_num | 231388276 |
| open_access_boolean | |
| owner | DE-83 DE-11 |
| owner_facet | DE-83 DE-11 |
| physical | IX, 461 S. Ill. |
| publishDate | 1992 |
| publishDateSearch | 1992 |
| publishDateSort | 1992 |
| 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., 1. Nachdr. Bonn [u.a.] Addison-Wesley 1992 IX, 461 S. Ill. txt rdacontent n rdamedia nc rdacarrier Internationale Computer-Bibliothek Komplexitätstheorie (DE-588)4120591-1 gnd rswk-swf 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 Berechenbarkeit (DE-588)4138368-0 gnd rswk-swf 1\p (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 2\p DE-604 Theoretische Informatik (DE-588)4196735-5 s 3\p DE-604 Ullman, Jeffrey D. 1942- Verfasser (DE-588)123598230 aut http://www3.ub.tu-berlin.de/ihv/000137570.pdf Inhaltsverzeichnis 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 3\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 Komplexitätstheorie (DE-588)4120591-1 gnd Automatentheorie (DE-588)4003953-5 gnd Theoretische Informatik (DE-588)4196735-5 gnd Formale Sprache (DE-588)4017848-1 gnd Berechenbarkeit (DE-588)4138368-0 gnd |
| subject_GND | (DE-588)4120591-1 (DE-588)4003953-5 (DE-588)4196735-5 (DE-588)4017848-1 (DE-588)4138368-0 (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 | Komplexitätstheorie (DE-588)4120591-1 gnd Automatentheorie (DE-588)4003953-5 gnd Theoretische Informatik (DE-588)4196735-5 gnd Formale Sprache (DE-588)4017848-1 gnd Berechenbarkeit (DE-588)4138368-0 gnd |
| topic_facet | Komplexitätstheorie Automatentheorie Theoretische Informatik Formale Sprache Berechenbarkeit Lehrbuch |
| url | http://www3.ub.tu-berlin.de/ihv/000137570.pdf |
| work_keys_str_mv | AT hopcroftjohne introductiontoautomatatheorylanguagesandcomputation AT ullmanjeffreyd introductiontoautomatatheorylanguagesandcomputation AT hopcroftjohne einfuhrungindieautomatentheorieformalesprachenundkomplexitatstheorie AT ullmanjeffreyd einfuhrungindieautomatentheorieformalesprachenundkomplexitatstheorie |