Introduction to automata theory, languages, and computation:
Gespeichert in:
Hauptverfasser: | , , |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
Harlow
Pearson Addison-Wesley
2014
|
Ausgabe: | 3. ed., New international ed. |
Schriftenreihe: | Always learning
|
Schlagworte: | |
Online-Zugang: | Inhaltsverzeichnis |
Beschreibung: | Includes bibliographical references and index |
Beschreibung: | II, 488 S. graph. Darst. |
ISBN: | 9781292039053 1292039051 |
Internformat
MARC
LEADER | 00000nam a2200000zc 4500 | ||
---|---|---|---|
001 | BV041725462 | ||
003 | DE-604 | ||
005 | 20140327 | ||
007 | t | ||
008 | 140310s2014 xxud||| |||| 00||| eng d | ||
020 | |a 9781292039053 |9 978-1-292-03905-3 | ||
020 | |a 1292039051 |9 1-292-03905-1 | ||
035 | |a (OCoLC)876730878 | ||
035 | |a (DE-599)BVBBV041725462 | ||
040 | |a DE-604 |b ger |e aacr | ||
041 | 0 | |a eng | |
044 | |a xxu |c US | ||
049 | |a DE-473 |a DE-739 |a DE-20 |a DE-861 |a DE-355 |a DE-1043 | ||
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 | |
245 | 1 | 0 | |a Introduction to automata theory, languages, and computation |c John E. Hopcroft ; Rajeev Motwani ; Jeffrey D. Ullman |
246 | 1 | 3 | |a Automata theory, languages, and computation |
250 | |a 3. ed., New international ed. | ||
264 | 1 | |a Harlow |b Pearson Addison-Wesley |c 2014 | |
300 | |a II, 488 S. |b graph. Darst. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |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 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 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 | |
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 | |
856 | 4 | 2 | |m Digitalisierung UB Bamberg - ADAM Catalogue Enrichment |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=027172338&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
999 | |a oai:aleph.bib-bvb.de:BVB01-027172338 | ||
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_ | 1804152005790269440 |
---|---|
adam_text | Ο Ν
CUSTOM
B R A R Y
Table of Contents
Chapter I
.
Automata: The Methods and the Madness
John E. Hopcroft/Rajeev Motwani/Jeffrey D.
Ullman
Chapter
2.
Finite Automata
John E. Hopcroft/Rajeev Motwani/Jeffrey D.
Ullman
Chapter
3.
Regular Expressions and Languages
John E. Hopcroft/Rajeev Motwani/Jeffrey D.
Ullman
Chapter
4.
Properties of Regular Languages
John E. Hopcroft/Rajeev Motwani/Jeffrey D.
Ullman
Chapter
5.
Context-Free Grammars and Languages
John E. Hopcroft/Rajeev Motwani/Jeffrey D.
Ullman
Chapter
6.
Pushdown Automata
John E. Hopcroft/Rajeev Motwani/Jeffrey D.
Ullman
Chapter
7.
Properties of Context-Free Languages
John E. Hopcroft/Rajeev Motwani/Jeffrey D.
Ullman
Chapter
8.
Introduction to Turing Machines
John E. Hopcroft/Rajeev Motwani/Jeffrey D.
Ullman
Chapter
9.
Undecidability
John E. Hopcroft/Rajeev Motwani/Jeffrey D.
Ullman
Chapter 1
0.
Intractable Problems
John E. Hopcroft/Rajeev Motwani/Jeffrey D.
Ullman
Index
1
37
85
127
171
225
261
315
377
425
483
|
any_adam_object | 1 |
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 | BV041725462 |
classification_rvk | ST 136 |
ctrlnum | (OCoLC)876730878 (DE-599)BVBBV041725462 |
discipline | Informatik |
edition | 3. ed., New international ed. |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02614nam a2200589zc 4500</leader><controlfield tag="001">BV041725462</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20140327 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">140310s2014 xxud||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781292039053</subfield><subfield code="9">978-1-292-03905-3</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1292039051</subfield><subfield code="9">1-292-03905-1</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)876730878</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV041725462</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-473</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-861</subfield><subfield code="a">DE-355</subfield><subfield code="a">DE-1043</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="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="246" ind1="1" ind2="3"><subfield code="a">Automata theory, languages, and computation</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">3. ed., New international ed.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Harlow</subfield><subfield code="b">Pearson Addison-Wesley</subfield><subfield code="c">2014</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">II, 488 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">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">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">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="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="856" ind1="4" ind2="2"><subfield code="m">Digitalisierung UB Bamberg - ADAM Catalogue Enrichment</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=027172338&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-027172338</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.BV041725462 |
illustrated | Illustrated |
indexdate | 2024-07-10T01:03:50Z |
institution | BVB |
isbn | 9781292039053 1292039051 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-027172338 |
oclc_num | 876730878 |
open_access_boolean | |
owner | DE-473 DE-BY-UBG DE-739 DE-20 DE-861 DE-355 DE-BY-UBR DE-1043 |
owner_facet | DE-473 DE-BY-UBG DE-739 DE-20 DE-861 DE-355 DE-BY-UBR DE-1043 |
physical | II, 488 S. graph. Darst. |
publishDate | 2014 |
publishDateSearch | 2014 |
publishDateSort | 2014 |
publisher | Pearson Addison-Wesley |
record_format | marc |
series2 | Always learning |
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 Automata theory, languages, and computation 3. ed., New international ed. Harlow Pearson Addison-Wesley 2014 II, 488 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Always learning Includes bibliographical references and index Machine theory Formal languages Computational complexity Komplexitätstheorie (DE-588)4120591-1 gnd rswk-swf Automatentheorie (DE-588)4003953-5 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 Digitalisierung UB Bamberg - ADAM Catalogue Enrichment application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=027172338&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA 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 |
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 Komplexitätstheorie (DE-588)4120591-1 gnd Automatentheorie (DE-588)4003953-5 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)4120591-1 (DE-588)4003953-5 (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_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 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 | Machine theory Formal languages Computational complexity Komplexitätstheorie (DE-588)4120591-1 gnd Automatentheorie (DE-588)4003953-5 gnd Berechenbarkeit (DE-588)4138368-0 gnd Formale Sprache (DE-588)4017848-1 gnd Theoretische Informatik (DE-588)4196735-5 gnd |
topic_facet | Machine theory Formal languages Computational complexity Komplexitätstheorie Automatentheorie Berechenbarkeit Formale Sprache Theoretische Informatik Lehrbuch |
url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=027172338&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
work_keys_str_mv | AT hopcroftjohne introductiontoautomatatheorylanguagesandcomputation AT motwanirajeev introductiontoautomatatheorylanguagesandcomputation AT ullmanjeffreyd introductiontoautomatatheorylanguagesandcomputation AT hopcroftjohne automatatheorylanguagesandcomputation AT motwanirajeev automatatheorylanguagesandcomputation AT ullmanjeffreyd automatatheorylanguagesandcomputation |