Introduction to automata theory, languages, and computation:
Gespeichert in:
Hauptverfasser: | , , |
---|---|
Format: | Elektronisch E-Book |
Sprache: | English |
Veröffentlicht: |
Harlow, England
Pearson
[2014]
|
Ausgabe: | Third edition, Pearson new international edition |
Schriftenreihe: | Always learning
|
Schlagworte: | |
Online-Zugang: | FHD01 TUBA1 TUM01 UPA01 |
Beschreibung: | Includes bibliographical references and index |
Beschreibung: | 1 Online-Ressource (II, 488 Seiten) |
ISBN: | 9781292056166 |
Internformat
MARC
LEADER | 00000nmm a2200000zc 4500 | ||
---|---|---|---|
001 | BV044875919 | ||
003 | DE-604 | ||
005 | 20240131 | ||
007 | cr|uuu---uuuuu | ||
008 | 180321s2014 xxu|||| o||u| ||||||eng d | ||
020 | |a 9781292056166 |9 978-1-292-05616-6 | ||
035 | |a (ZDB-150-PEB)978-1-292-05616-6 | ||
035 | |a (OCoLC)1029456650 | ||
035 | |a (DE-599)BVBBV044875919 | ||
040 | |a DE-604 |b ger |e rda | ||
041 | 0 | |a eng | |
044 | |a xxu |c US | ||
049 | |a DE-1050 |a DE-91G |a DE-739 |a DE-83 | ||
084 | |a ST 136 |0 (DE-625)143591: |2 rvk | ||
084 | |a DAT 517 |2 stub | ||
084 | |a DAT 500 |2 stub | ||
084 | |a DAT 555 |2 stub | ||
084 | |a DAT 550 |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 Hopcroft, Motwani, Ullman |
246 | 1 | 3 | |a Automata theory, languages, and computation |
250 | |a Third edition, Pearson new international edition | ||
264 | 1 | |a Harlow, England |b Pearson |c [2014] | |
300 | |a 1 Online-Ressource (II, 488 Seiten) | ||
336 | |b txt |2 rdacontent | ||
337 | |b c |2 rdamedia | ||
338 | |b cr |2 rdacarrier | ||
490 | 0 | |a Always learning | |
500 | |a Includes bibliographical references and index | ||
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 Theoretische Informatik |0 (DE-588)4196735-5 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Berechenbarkeit |0 (DE-588)4138368-0 |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 | |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 | |
776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 978-1-292-03905-3 |
912 | |a ZDB-30-PQE |a ZDB-150-PEB | ||
999 | |a oai:aleph.bib-bvb.de:BVB01-030270261 | ||
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 | |
966 | e | |u https://ebookcentral.proquest.com/lib/th-deggendorf/detail.action?docID=5186195 |l FHD01 |p ZDB-30-PQE |q FHD01_PQE_Kauf |x Aggregator |3 Volltext | |
966 | e | |u https://elibrary.pearson.de/book/99.150005/9781292056166 |l TUBA1 |p ZDB-150-PEB |q TUB_EBS_Pearson |x Verlag |3 Volltext | |
966 | e | |u https://ebookcentral.proquest.com/lib/munchentech/detail.action?docID=5832060 |l TUM01 |p ZDB-30-PQE |q TUM_Einzelkauf |x Aggregator |3 Volltext | |
966 | e | |u https://elibrary.pearson.de/book/99.150005/9781292056166 |l UPA01 |p ZDB-150-PEB |q UPA_Einzelkauf_Pearson |x Verlag |3 Volltext |
Datensatz im Suchindex
_version_ | 1804178410375741440 |
---|---|
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 | BV044875919 |
classification_rvk | ST 136 |
classification_tum | DAT 517 DAT 500 DAT 555 DAT 550 |
collection | ZDB-30-PQE ZDB-150-PEB |
ctrlnum | (ZDB-150-PEB)978-1-292-05616-6 (OCoLC)1029456650 (DE-599)BVBBV044875919 |
discipline | Informatik |
edition | Third edition, Pearson new international edition |
format | Electronic eBook |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03287nmm a2200745zc 4500</leader><controlfield tag="001">BV044875919</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20240131 </controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">180321s2014 xxu|||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781292056166</subfield><subfield code="9">978-1-292-05616-6</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-150-PEB)978-1-292-05616-6</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1029456650</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV044875919</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</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-1050</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-83</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 517</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 500</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 555</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 550</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">Hopcroft, Motwani, Ullman</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">Automata theory, languages, and computation</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">Third edition, Pearson new international edition</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Harlow, England</subfield><subfield code="b">Pearson</subfield><subfield code="c">[2014]</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (II, 488 Seiten)</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">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Always learning</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references and index</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">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">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">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="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="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">978-1-292-03905-3</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-30-PQE</subfield><subfield code="a">ZDB-150-PEB</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-030270261</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="966" ind1="e" ind2=" "><subfield code="u">https://ebookcentral.proquest.com/lib/th-deggendorf/detail.action?docID=5186195</subfield><subfield code="l">FHD01</subfield><subfield code="p">ZDB-30-PQE</subfield><subfield code="q">FHD01_PQE_Kauf</subfield><subfield code="x">Aggregator</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://elibrary.pearson.de/book/99.150005/9781292056166</subfield><subfield code="l">TUBA1</subfield><subfield code="p">ZDB-150-PEB</subfield><subfield code="q">TUB_EBS_Pearson</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://ebookcentral.proquest.com/lib/munchentech/detail.action?docID=5832060</subfield><subfield code="l">TUM01</subfield><subfield code="p">ZDB-30-PQE</subfield><subfield code="q">TUM_Einzelkauf</subfield><subfield code="x">Aggregator</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://elibrary.pearson.de/book/99.150005/9781292056166</subfield><subfield code="l">UPA01</subfield><subfield code="p">ZDB-150-PEB</subfield><subfield code="q">UPA_Einzelkauf_Pearson</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
genre | 1\p (DE-588)4123623-3 Lehrbuch gnd-content |
genre_facet | Lehrbuch |
id | DE-604.BV044875919 |
illustrated | Not Illustrated |
indexdate | 2024-07-10T08:03:32Z |
institution | BVB |
isbn | 9781292056166 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-030270261 |
oclc_num | 1029456650 |
open_access_boolean | |
owner | DE-1050 DE-91G DE-BY-TUM DE-739 DE-83 |
owner_facet | DE-1050 DE-91G DE-BY-TUM DE-739 DE-83 |
physical | 1 Online-Ressource (II, 488 Seiten) |
psigel | ZDB-30-PQE ZDB-150-PEB ZDB-30-PQE FHD01_PQE_Kauf ZDB-150-PEB TUB_EBS_Pearson ZDB-30-PQE TUM_Einzelkauf ZDB-150-PEB UPA_Einzelkauf_Pearson |
publishDate | 2014 |
publishDateSearch | 2014 |
publishDateSort | 2014 |
publisher | Pearson |
record_format | marc |
series2 | Always learning |
spelling | Hopcroft, John E. 1939- Verfasser (DE-588)112071481 aut Introduction to automata theory, languages, and computation Hopcroft, Motwani, Ullman Automata theory, languages, and computation Third edition, Pearson new international edition Harlow, England Pearson [2014] 1 Online-Ressource (II, 488 Seiten) txt rdacontent c rdamedia cr rdacarrier Always learning Includes bibliographical references and index Machine theory Formal languages Computational complexity Automatentheorie (DE-588)4003953-5 gnd rswk-swf Theoretische Informatik (DE-588)4196735-5 gnd rswk-swf Berechenbarkeit (DE-588)4138368-0 gnd rswk-swf Komplexitätstheorie (DE-588)4120591-1 gnd rswk-swf Formale Sprache (DE-588)4017848-1 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 Erscheint auch als Druck-Ausgabe 978-1-292-03905-3 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 Machine theory Formal languages Computational complexity Automatentheorie (DE-588)4003953-5 gnd Theoretische Informatik (DE-588)4196735-5 gnd Berechenbarkeit (DE-588)4138368-0 gnd Komplexitätstheorie (DE-588)4120591-1 gnd Formale Sprache (DE-588)4017848-1 gnd |
subject_GND | (DE-588)4003953-5 (DE-588)4196735-5 (DE-588)4138368-0 (DE-588)4120591-1 (DE-588)4017848-1 (DE-588)4123623-3 |
title | Introduction to automata theory, languages, and computation |
title_alt | 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 Hopcroft, Motwani, Ullman |
title_fullStr | Introduction to automata theory, languages, and computation Hopcroft, Motwani, Ullman |
title_full_unstemmed | Introduction to automata theory, languages, and computation Hopcroft, Motwani, Ullman |
title_short | Introduction to automata theory, languages, and computation |
title_sort | introduction to automata theory languages and computation |
topic | Machine theory Formal languages Computational complexity Automatentheorie (DE-588)4003953-5 gnd Theoretische Informatik (DE-588)4196735-5 gnd Berechenbarkeit (DE-588)4138368-0 gnd Komplexitätstheorie (DE-588)4120591-1 gnd Formale Sprache (DE-588)4017848-1 gnd |
topic_facet | Machine theory Formal languages Computational complexity Automatentheorie Theoretische Informatik Berechenbarkeit Komplexitätstheorie Formale Sprache Lehrbuch |
work_keys_str_mv | AT hopcroftjohne introductiontoautomatatheorylanguagesandcomputation AT motwanirajeev introductiontoautomatatheorylanguagesandcomputation AT ullmanjeffreyd introductiontoautomatatheorylanguagesandcomputation AT hopcroftjohne automatatheorylanguagesandcomputation AT motwanirajeev automatatheorylanguagesandcomputation AT ullmanjeffreyd automatatheorylanguagesandcomputation |