Languages and machines: an introduction to the theory of computer science
Saved in:
| Main Author: | |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Boston ; Munich
Addison-Wesley
2006
|
| Edition: | third edition |
| Series: | Pearson international edition
|
| Subjects: | |
| Online Access: | Table of contents Inhaltsverzeichnis |
| Physical Description: | XVII, 654 Seiten |
| ISBN: | 0321315340 |
Staff View
MARC
| LEADER | 00000nam a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV019844422 | ||
| 003 | DE-604 | ||
| 005 | 20200414 | ||
| 007 | t | ||
| 008 | 050614s2006 xxu |||| 00||| eng d | ||
| 010 | |a 2004030342 | ||
| 020 | |a 0321315340 |c alk. paper |9 0-321-31534-0 | ||
| 035 | |a (OCoLC)57344192 | ||
| 035 | |a (DE-599)BVBBV019844422 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 044 | |a xxu |c US | ||
| 049 | |a DE-29T |a DE-703 |a DE-634 |a DE-473 | ||
| 050 | 0 | |a QA267.3 | |
| 082 | 0 | |a 511.3 |2 22 | |
| 084 | |a ST 130 |0 (DE-625)143588: |2 rvk | ||
| 100 | 1 | |a Sudkamp, Thomas A. |d 1953- |e Verfasser |0 (DE-588)123409594 |4 aut | |
| 245 | 1 | 0 | |a Languages and machines |b an introduction to the theory of computer science |c Thomas A. Sudkamp |
| 250 | |a third edition | ||
| 264 | 1 | |a Boston ; Munich |b Addison-Wesley |c 2006 | |
| 300 | |a XVII, 654 Seiten | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 0 | |a Pearson international edition | |
| 650 | 4 | |a Automates mathématiques, Théorie des | |
| 650 | 4 | |a Complexité de calcul (Informatique) | |
| 650 | 7 | |a Formele talen |2 gtt | |
| 650 | 4 | |a Langages formels | |
| 650 | 7 | |a Programmeertalen |2 gtt | |
| 650 | 4 | |a Formal languages | |
| 650 | 4 | |a Machine theory | |
| 650 | 4 | |a Computational complexity | |
| 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 Komplexitätstheorie |0 (DE-588)4120591-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Theoretische Informatik |0 (DE-588)4196735-5 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Theoretische Informatik |0 (DE-588)4196735-5 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Formale Sprache |0 (DE-588)4017848-1 |D s |
| 689 | 1 | 1 | |a Automatentheorie |0 (DE-588)4003953-5 |D s |
| 689 | 1 | 2 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |D s |
| 689 | 1 | |5 DE-604 | |
| 775 | 0 | 8 | |i Äquivalent |a Sudkamp, Thomas A. |t Languages and machines |b third edition |d Uttar Pradesh, India: Pearson, 2008 |z 978-81-317-1475-1 |w (DE-604)BV046668244 |
| 856 | 4 | |u http://www.loc.gov/catdir/toc/ecip055/2004030342.html |3 Table of contents | |
| 856 | 4 | 2 | |m LoC Fremddatenuebernahme |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=013169259&sequence=000005&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-013169259 | ||
Record in the Search Index
| _version_ | 1804133356782223360 |
|---|---|
| adam_text | LANGUAGES AND MACHINES / SUDKAMP, THOMAS A. : 2005
TABLE OF CONTENTS / INHALTSVERZEICHNIS
INTRODUCTION
MATHEMATICAL PRELIMINARIES
CONTEXT-FREE GRAMMARS
NORMAL FORMS FOR CONTEXT-FREE GRAMMARS
FINITE AUTOMATA
PROPERTIES OF REGULAR LANGUAGES
PUSHDOWN AUTOMATA AND CONTEXT-FREE LANGUAGES
TURING MACHINES
TURING COMPUTABLE FUNCTIONS
THE CHOMSKY HIERARCHY
DECISION PROBLEMS AND THE CHURCH-TURING THESIS
UNDECIDABILITY
MU-RECURSIVE FUNCTIONS
COMPUTATIONAL COMPLEXITY
P, NP AND COOK S THEOREM
NP-COMPLETE PROBLEMS
ADDITIONAL COMPLEXITY CLASSES
PARSING: AN INTRODUCTION
LL(K) GRAMMARS
LR(K) GRAMMARS
BIBLIOGRAPHY
INDEX.
DIESES SCHRIFTSTUECK WURDE MASCHINELL ERZEUGT.
|
| any_adam_object | 1 |
| author | Sudkamp, Thomas A. 1953- |
| author_GND | (DE-588)123409594 |
| author_facet | Sudkamp, Thomas A. 1953- |
| author_role | aut |
| author_sort | Sudkamp, Thomas A. 1953- |
| author_variant | t a s ta tas |
| building | Verbundindex |
| bvnumber | BV019844422 |
| callnumber-first | Q - Science |
| callnumber-label | QA267 |
| callnumber-raw | QA267.3 |
| callnumber-search | QA267.3 |
| callnumber-sort | QA 3267.3 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | ST 130 |
| ctrlnum | (OCoLC)57344192 (DE-599)BVBBV019844422 |
| dewey-full | 511.3 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511.3 |
| dewey-search | 511.3 |
| dewey-sort | 3511.3 |
| dewey-tens | 510 - Mathematics |
| discipline | Informatik Mathematik |
| edition | third edition |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02407nam a2200589zc 4500</leader><controlfield tag="001">BV019844422</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20200414 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">050614s2006 xxu |||| 00||| eng d</controlfield><datafield tag="010" ind1=" " ind2=" "><subfield code="a">2004030342</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0321315340</subfield><subfield code="c">alk. paper</subfield><subfield code="9">0-321-31534-0</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)57344192</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV019844422</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-29T</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-473</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA267.3</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.3</subfield><subfield code="2">22</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">Sudkamp, Thomas A.</subfield><subfield code="d">1953-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)123409594</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Languages and machines</subfield><subfield code="b">an introduction to the theory of computer science</subfield><subfield code="c">Thomas A. Sudkamp</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">third edition</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Boston ; Munich</subfield><subfield code="b">Addison-Wesley</subfield><subfield code="c">2006</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XVII, 654 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">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">Pearson international edition</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Automates mathématiques, Théorie des</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Complexité de calcul (Informatique)</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Formele talen</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Langages formels</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Programmeertalen</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Formal languages</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Machine theory</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">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">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">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="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">Formale Sprache</subfield><subfield code="0">(DE-588)4017848-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><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="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=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="775" ind1="0" ind2="8"><subfield code="i">Äquivalent</subfield><subfield code="a">Sudkamp, Thomas A.</subfield><subfield code="t">Languages and machines</subfield><subfield code="b">third edition</subfield><subfield code="d">Uttar Pradesh, India: Pearson, 2008</subfield><subfield code="z">978-81-317-1475-1</subfield><subfield code="w">(DE-604)BV046668244</subfield></datafield><datafield tag="856" ind1="4" ind2=" "><subfield code="u">http://www.loc.gov/catdir/toc/ecip055/2004030342.html</subfield><subfield code="3">Table of contents</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">LoC Fremddatenuebernahme</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=013169259&sequence=000005&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-013169259</subfield></datafield></record></collection> |
| id | DE-604.BV019844422 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T20:07:25Z |
| institution | BVB |
| isbn | 0321315340 |
| language | English |
| lccn | 2004030342 |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-013169259 |
| oclc_num | 57344192 |
| open_access_boolean | |
| owner | DE-29T DE-703 DE-634 DE-473 DE-BY-UBG |
| owner_facet | DE-29T DE-703 DE-634 DE-473 DE-BY-UBG |
| physical | XVII, 654 Seiten |
| publishDate | 2006 |
| publishDateSearch | 2006 |
| publishDateSort | 2006 |
| publisher | Addison-Wesley |
| record_format | marc |
| series2 | Pearson international edition |
| spelling | Sudkamp, Thomas A. 1953- Verfasser (DE-588)123409594 aut Languages and machines an introduction to the theory of computer science Thomas A. Sudkamp third edition Boston ; Munich Addison-Wesley 2006 XVII, 654 Seiten txt rdacontent n rdamedia nc rdacarrier Pearson international edition Automates mathématiques, Théorie des Complexité de calcul (Informatique) Formele talen gtt Langages formels Programmeertalen gtt Formal languages Machine theory Computational complexity Formale Sprache (DE-588)4017848-1 gnd rswk-swf Automatentheorie (DE-588)4003953-5 gnd rswk-swf Komplexitätstheorie (DE-588)4120591-1 gnd rswk-swf Theoretische Informatik (DE-588)4196735-5 gnd rswk-swf Theoretische Informatik (DE-588)4196735-5 s DE-604 Formale Sprache (DE-588)4017848-1 s Automatentheorie (DE-588)4003953-5 s Komplexitätstheorie (DE-588)4120591-1 s Äquivalent Sudkamp, Thomas A. Languages and machines third edition Uttar Pradesh, India: Pearson, 2008 978-81-317-1475-1 (DE-604)BV046668244 http://www.loc.gov/catdir/toc/ecip055/2004030342.html Table of contents LoC Fremddatenuebernahme application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=013169259&sequence=000005&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Sudkamp, Thomas A. 1953- Languages and machines an introduction to the theory of computer science Automates mathématiques, Théorie des Complexité de calcul (Informatique) Formele talen gtt Langages formels Programmeertalen gtt Formal languages Machine theory Computational complexity Formale Sprache (DE-588)4017848-1 gnd Automatentheorie (DE-588)4003953-5 gnd Komplexitätstheorie (DE-588)4120591-1 gnd Theoretische Informatik (DE-588)4196735-5 gnd |
| subject_GND | (DE-588)4017848-1 (DE-588)4003953-5 (DE-588)4120591-1 (DE-588)4196735-5 |
| title | Languages and machines an introduction to the theory of computer science |
| title_auth | Languages and machines an introduction to the theory of computer science |
| title_exact_search | Languages and machines an introduction to the theory of computer science |
| title_full | Languages and machines an introduction to the theory of computer science Thomas A. Sudkamp |
| title_fullStr | Languages and machines an introduction to the theory of computer science Thomas A. Sudkamp |
| title_full_unstemmed | Languages and machines an introduction to the theory of computer science Thomas A. Sudkamp |
| title_short | Languages and machines |
| title_sort | languages and machines an introduction to the theory of computer science |
| title_sub | an introduction to the theory of computer science |
| topic | Automates mathématiques, Théorie des Complexité de calcul (Informatique) Formele talen gtt Langages formels Programmeertalen gtt Formal languages Machine theory Computational complexity Formale Sprache (DE-588)4017848-1 gnd Automatentheorie (DE-588)4003953-5 gnd Komplexitätstheorie (DE-588)4120591-1 gnd Theoretische Informatik (DE-588)4196735-5 gnd |
| topic_facet | Automates mathématiques, Théorie des Complexité de calcul (Informatique) Formele talen Langages formels Programmeertalen Formal languages Machine theory Computational complexity Formale Sprache Automatentheorie Komplexitätstheorie Theoretische Informatik |
| url | http://www.loc.gov/catdir/toc/ecip055/2004030342.html http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=013169259&sequence=000005&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT sudkampthomasa languagesandmachinesanintroductiontothetheoryofcomputerscience |