Computability, complexity, and languages: fundamentals of theoretical computer science
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
New York [u.a.]
Acad. Press
1983
|
| Ausgabe: | 1. print. |
| Schriftenreihe: | Computer science and applied mathematics
|
| Schlagworte: | |
| Beschreibung: | 425 S. |
| ISBN: | 0122063805 |
Internformat
MARC
| LEADER | 00000nam a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV021933826 | ||
| 003 | DE-604 | ||
| 005 | 20180302 | ||
| 007 | t | ||
| 008 | 970314s1983 |||| 00||| eng d | ||
| 020 | |a 0122063805 |9 0-12-206380-5 | ||
| 035 | |a (OCoLC)9282499 | ||
| 035 | |a (DE-599)BVBBV021933826 | ||
| 040 | |a DE-604 |b ger | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-706 | ||
| 050 | 0 | |a QA267 | |
| 082 | 0 | |a 001.64/01 |2 19 | |
| 100 | 1 | |a Davis, Martin |d 1928-2023 |e Verfasser |0 (DE-588)116040866 |4 aut | |
| 245 | 1 | 0 | |a Computability, complexity, and languages |b fundamentals of theoretical computer science |
| 250 | |a 1. print. | ||
| 264 | 1 | |a New York [u.a.] |b Acad. Press |c 1983 | |
| 300 | |a 425 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 0 | |a Computer science and applied mathematics | |
| 650 | 4 | |a Automates mathématiques, Théorie des | |
| 650 | 4 | |a Complexité de calcul (Informatique) | |
| 650 | 7 | |a Fundamentele informatica |2 gtt | |
| 650 | 7 | |a Informatica |2 gtt | |
| 650 | 4 | |a Langages formels | |
| 650 | 4 | |a Computational complexity | |
| 650 | 4 | |a Formal languages | |
| 650 | 4 | |a Machine theory | |
| 650 | 0 | 7 | |a Komplexität |0 (DE-588)4135369-9 |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 |
| 689 | 0 | 0 | |a Formale Sprache |0 (DE-588)4017848-1 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Komplexität |0 (DE-588)4135369-9 |D s |
| 689 | 1 | |5 DE-604 | |
| 689 | 2 | 0 | |a Berechenbarkeit |0 (DE-588)4138368-0 |D s |
| 689 | 2 | |5 DE-604 | |
| 689 | 3 | 0 | |a Automatentheorie |0 (DE-588)4003953-5 |D s |
| 689 | 3 | |8 1\p |5 DE-604 | |
| 689 | 4 | 0 | |a Theoretische Informatik |0 (DE-588)4196735-5 |D s |
| 689 | 4 | |8 2\p |5 DE-604 | |
| 700 | 1 | |a Weyuker, Elaine J. |e Verfasser |0 (DE-588)135877199 |4 aut | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-015148980 | ||
| 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_ | 1804135891619282944 |
|---|---|
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author | Davis, Martin 1928-2023 Weyuker, Elaine J. |
| author_GND | (DE-588)116040866 (DE-588)135877199 |
| author_facet | Davis, Martin 1928-2023 Weyuker, Elaine J. |
| author_role | aut aut |
| author_sort | Davis, Martin 1928-2023 |
| author_variant | m d md e j w ej ejw |
| building | Verbundindex |
| bvnumber | BV021933826 |
| callnumber-first | Q - Science |
| callnumber-label | QA267 |
| callnumber-raw | QA267 |
| callnumber-search | QA267 |
| callnumber-sort | QA 3267 |
| callnumber-subject | QA - Mathematics |
| ctrlnum | (OCoLC)9282499 (DE-599)BVBBV021933826 |
| dewey-full | 001.64/01 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 001 - Knowledge |
| dewey-raw | 001.64/01 |
| dewey-search | 001.64/01 |
| dewey-sort | 11.64 11 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Allgemeines |
| discipline_str_mv | Allgemeines |
| edition | 1. print. |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02184nam a2200613zc 4500</leader><controlfield tag="001">BV021933826</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20180302 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">970314s1983 |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0122063805</subfield><subfield code="9">0-12-206380-5</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)9282499</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV021933826</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">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-706</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA267</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">001.64/01</subfield><subfield code="2">19</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Davis, Martin</subfield><subfield code="d">1928-2023</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)116040866</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Computability, complexity, and languages</subfield><subfield code="b">fundamentals of theoretical computer science</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">1. print.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">New York [u.a.]</subfield><subfield code="b">Acad. Press</subfield><subfield code="c">1983</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">425 S.</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">Computer science and applied mathematics</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">Fundamentele informatica</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Informatica</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="4"><subfield code="a">Computational complexity</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="0" ind2="7"><subfield code="a">Komplexität</subfield><subfield code="0">(DE-588)4135369-9</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="689" ind1="0" 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="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Komplexität</subfield><subfield code="0">(DE-588)4135369-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Berechenbarkeit</subfield><subfield code="0">(DE-588)4138368-0</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">Automatentheorie</subfield><subfield code="0">(DE-588)4003953-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="3" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="4" 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="4" ind2=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Weyuker, Elaine J.</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)135877199</subfield><subfield code="4">aut</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-015148980</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> |
| id | DE-604.BV021933826 |
| illustrated | Not Illustrated |
| index_date | 2024-07-02T16:06:29Z |
| indexdate | 2024-07-09T20:47:43Z |
| institution | BVB |
| isbn | 0122063805 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-015148980 |
| oclc_num | 9282499 |
| open_access_boolean | |
| owner | DE-706 |
| owner_facet | DE-706 |
| physical | 425 S. |
| publishDate | 1983 |
| publishDateSearch | 1983 |
| publishDateSort | 1983 |
| publisher | Acad. Press |
| record_format | marc |
| series2 | Computer science and applied mathematics |
| spelling | Davis, Martin 1928-2023 Verfasser (DE-588)116040866 aut Computability, complexity, and languages fundamentals of theoretical computer science 1. print. New York [u.a.] Acad. Press 1983 425 S. txt rdacontent n rdamedia nc rdacarrier Computer science and applied mathematics Automates mathématiques, Théorie des Complexité de calcul (Informatique) Fundamentele informatica gtt Informatica gtt Langages formels Computational complexity Formal languages Machine theory Komplexität (DE-588)4135369-9 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 Formale Sprache (DE-588)4017848-1 s DE-604 Komplexität (DE-588)4135369-9 s Berechenbarkeit (DE-588)4138368-0 s Automatentheorie (DE-588)4003953-5 s 1\p DE-604 Theoretische Informatik (DE-588)4196735-5 s 2\p DE-604 Weyuker, Elaine J. Verfasser (DE-588)135877199 aut 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 | Davis, Martin 1928-2023 Weyuker, Elaine J. Computability, complexity, and languages fundamentals of theoretical computer science Automates mathématiques, Théorie des Complexité de calcul (Informatique) Fundamentele informatica gtt Informatica gtt Langages formels Computational complexity Formal languages Machine theory Komplexität (DE-588)4135369-9 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)4135369-9 (DE-588)4003953-5 (DE-588)4196735-5 (DE-588)4017848-1 (DE-588)4138368-0 |
| title | Computability, complexity, and languages fundamentals of theoretical computer science |
| title_auth | Computability, complexity, and languages fundamentals of theoretical computer science |
| title_exact_search | Computability, complexity, and languages fundamentals of theoretical computer science |
| title_exact_search_txtP | Computability, complexity, and languages fundamentals of theoretical computer science |
| title_full | Computability, complexity, and languages fundamentals of theoretical computer science |
| title_fullStr | Computability, complexity, and languages fundamentals of theoretical computer science |
| title_full_unstemmed | Computability, complexity, and languages fundamentals of theoretical computer science |
| title_short | Computability, complexity, and languages |
| title_sort | computability complexity and languages fundamentals of theoretical computer science |
| title_sub | fundamentals of theoretical computer science |
| topic | Automates mathématiques, Théorie des Complexité de calcul (Informatique) Fundamentele informatica gtt Informatica gtt Langages formels Computational complexity Formal languages Machine theory Komplexität (DE-588)4135369-9 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 | Automates mathématiques, Théorie des Complexité de calcul (Informatique) Fundamentele informatica Informatica Langages formels Computational complexity Formal languages Machine theory Komplexität Automatentheorie Theoretische Informatik Formale Sprache Berechenbarkeit |
| work_keys_str_mv | AT davismartin computabilitycomplexityandlanguagesfundamentalsoftheoreticalcomputerscience AT weyukerelainej computabilitycomplexityandlanguagesfundamentalsoftheoreticalcomputerscience |