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
|
Schriftenreihe: | Internationale Computer-Bibliothek.
|
Schlagworte: | |
Beschreibung: | Literaturverz. S. [437] - 452 |
Beschreibung: | IX, 461 S. graph. Darst. |
ISBN: | 389319181X |
Internformat
MARC
LEADER | 00000nam a2200000 c 4500 | ||
---|---|---|---|
001 | BV005602840 | ||
003 | DE-604 | ||
005 | 20070411 | ||
007 | t | ||
008 | 921020s1990 d||| |||| 00||| ger d | ||
020 | |a 389319181X |9 3-89319-181-X | ||
035 | |a (OCoLC)248552971 | ||
035 | |a (DE-599)BVBBV005602840 | ||
040 | |a DE-604 |b ger |e rakwb | ||
041 | 0 | |a ger | |
049 | |a DE-862 |a DE-20 |a DE-29T | ||
084 | |a ST 130 |0 (DE-625)143588: |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 |
264 | 1 | |a Bonn [u.a.] |b Addison-Wesley |c 1990 | |
300 | |a IX, 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. | |
500 | |a Literaturverz. S. [437] - 452 | ||
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 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 |
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 | |
700 | 1 | |a Ullman, Jeffrey D. |d 1942- |e Verfasser |0 (DE-588)123598230 |4 aut | |
999 | |a oai:aleph.bib-bvb.de:BVB01-003509362 | ||
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
DE-BY-862_location | 2801 |
---|---|
DE-BY-FWS_call_number | 2900/06656 |
DE-BY-FWS_katkey | 102931 |
DE-BY-FWS_media_number | 083000183463 |
_version_ | 1806195607556063232 |
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 | BV005602840 |
classification_rvk | ST 130 |
ctrlnum | (OCoLC)248552971 (DE-599)BVBBV005602840 |
discipline | Informatik |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02025nam a2200493 c 4500</leader><controlfield tag="001">BV005602840</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20070411 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">921020s1990 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)BVBBV005602840</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">ger</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-862</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-29T</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">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="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">IX, 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="500" ind1=" " ind2=" "><subfield code="a">Literaturverz. S. [437] - 452</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">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="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="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-003509362</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.BV005602840 |
illustrated | Illustrated |
indexdate | 2024-08-01T16:26:01Z |
institution | BVB |
isbn | 389319181X |
language | German |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-003509362 |
oclc_num | 248552971 |
open_access_boolean | |
owner | DE-862 DE-BY-FWS DE-20 DE-29T |
owner_facet | DE-862 DE-BY-FWS DE-20 DE-29T |
physical | IX, 461 S. graph. Darst. |
publishDate | 1990 |
publishDateSearch | 1990 |
publishDateSort | 1990 |
publisher | Addison-Wesley |
record_format | marc |
series2 | Internationale Computer-Bibliothek. |
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 Berechenbarkeit (DE-588)4138368-0 gnd Formale Sprache (DE-588)4017848-1 gnd Automatentheorie (DE-588)4003953-5 gnd Theoretische Informatik (DE-588)4196735-5 gnd |
subject_GND | (DE-588)4120591-1 (DE-588)4138368-0 (DE-588)4017848-1 (DE-588)4003953-5 (DE-588)4196735-5 (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 Berechenbarkeit (DE-588)4138368-0 gnd Formale Sprache (DE-588)4017848-1 gnd Automatentheorie (DE-588)4003953-5 gnd Theoretische Informatik (DE-588)4196735-5 gnd |
topic_facet | Komplexitätstheorie Berechenbarkeit Formale Sprache Automatentheorie Theoretische Informatik Lehrbuch |
work_keys_str_mv | AT hopcroftjohne introductiontoautomatatheorylanguagesandcomputation AT ullmanjeffreyd introductiontoautomatatheorylanguagesandcomputation AT hopcroftjohne einfuhrungindieautomatentheorieformalesprachenundkomplexitatstheorie AT ullmanjeffreyd einfuhrungindieautomatentheorieformalesprachenundkomplexitatstheorie |
Schweinfurt Magazin
Signatur: |
2900 06656 |
---|---|
Exemplar 1 | ausleihbar Verfügbar Bestellen |