Languages and machines: an introduction to the theory of computer science
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Reading, Mass. [u.a.]
Addison-Wesley
1997
|
| Ausgabe: | 2. ed. |
| Schlagworte: | |
| Beschreibung: | Literaturangaben |
| Beschreibung: | XV, 569 S. graph. Darst. |
| ISBN: | 0201821362 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV011374874 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 970609s1997 d||| |||| 00||| eng d | ||
| 020 | |a 0201821362 |9 0-201-82136-2 | ||
| 035 | |a (OCoLC)33971946 | ||
| 035 | |a (DE-599)BVBBV011374874 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-384 |a DE-739 |a DE-634 | ||
| 050 | 0 | |a QA267.3 | |
| 082 | 0 | |a 511.3 |2 20 | |
| 084 | |a CM 5000 |0 (DE-625)18956: |2 rvk | ||
| 084 | |a ST 130 |0 (DE-625)143588: |2 rvk | ||
| 100 | 1 | |a Sudkamp, Thomas A. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Languages and machines |b an introduction to the theory of computer science |c Thomas A. Sudkamp |
| 250 | |a 2. ed. | ||
| 264 | 1 | |a Reading, Mass. [u.a.] |b Addison-Wesley |c 1997 | |
| 300 | |a XV, 569 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 500 | |a Literaturangaben | ||
| 650 | 7 | |a Automates |2 ram | |
| 650 | 4 | |a Complejidad computacional | |
| 650 | 7 | |a Complexités de calcul (informatique) |2 ram | |
| 650 | 7 | |a Formele talen |2 gtt | |
| 650 | 7 | |a Langages formels |2 ram | |
| 650 | 4 | |a Lenguaje formal | |
| 650 | 7 | |a Programmeertalen |2 gtt | |
| 650 | 4 | |a Teoría de las máquinas | |
| 650 | 7 | |a automate fini |2 inriac | |
| 650 | 7 | |a décidabilité |2 inriac | |
| 650 | 7 | |a grammaire formelle |2 inriac | |
| 650 | 7 | |a langage formel |2 inriac | |
| 650 | 7 | |a langage programmation |2 inriac | |
| 650 | 7 | |a machine Turing |2 inriac | |
| 650 | 7 | |a théorie complexité |2 inriac | |
| 650 | 4 | |a Computational complexity | |
| 650 | 4 | |a Formal languages | |
| 650 | 4 | |a Machine theory | |
| 650 | 0 | 7 | |a Theoretische Informatik |0 (DE-588)4196735-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 Automatentheorie |0 (DE-588)4003953-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Formale Sprache |0 (DE-588)4017848-1 |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 | |8 1\p |5 DE-604 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007644116 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
Datensatz im Suchindex
| _version_ | 1804125885273473024 |
|---|---|
| any_adam_object | |
| author | Sudkamp, Thomas A. |
| author_facet | Sudkamp, Thomas A. |
| author_role | aut |
| author_sort | Sudkamp, Thomas A. |
| author_variant | t a s ta tas |
| building | Verbundindex |
| bvnumber | BV011374874 |
| 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 | CM 5000 ST 130 |
| ctrlnum | (OCoLC)33971946 (DE-599)BVBBV011374874 |
| 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 Psychologie Mathematik |
| edition | 2. ed. |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02330nam a2200673 c 4500</leader><controlfield tag="001">BV011374874</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">970609s1997 d||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0201821362</subfield><subfield code="9">0-201-82136-2</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)33971946</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV011374874</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-384</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-634</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">20</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">CM 5000</subfield><subfield code="0">(DE-625)18956:</subfield><subfield code="2">rvk</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="e">Verfasser</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">2. ed.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Reading, Mass. [u.a.]</subfield><subfield code="b">Addison-Wesley</subfield><subfield code="c">1997</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XV, 569 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="500" ind1=" " ind2=" "><subfield code="a">Literaturangaben</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Automates</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Complejidad computacional</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Complexités de calcul (informatique)</subfield><subfield code="2">ram</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="7"><subfield code="a">Langages formels</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Lenguaje formal</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">Teoría de las máquinas</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">automate fini</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">décidabilité</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">grammaire formelle</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">langage formel</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">langage programmation</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">machine Turing</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">théorie complexité</subfield><subfield code="2">inriac</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">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">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">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="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="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007644116</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></record></collection> |
| id | DE-604.BV011374874 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T18:08:40Z |
| institution | BVB |
| isbn | 0201821362 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007644116 |
| oclc_num | 33971946 |
| open_access_boolean | |
| owner | DE-384 DE-739 DE-634 |
| owner_facet | DE-384 DE-739 DE-634 |
| physical | XV, 569 S. graph. Darst. |
| publishDate | 1997 |
| publishDateSearch | 1997 |
| publishDateSort | 1997 |
| publisher | Addison-Wesley |
| record_format | marc |
| spelling | Sudkamp, Thomas A. Verfasser aut Languages and machines an introduction to the theory of computer science Thomas A. Sudkamp 2. ed. Reading, Mass. [u.a.] Addison-Wesley 1997 XV, 569 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Literaturangaben Automates ram Complejidad computacional Complexités de calcul (informatique) ram Formele talen gtt Langages formels ram Lenguaje formal Programmeertalen gtt Teoría de las máquinas automate fini inriac décidabilité inriac grammaire formelle inriac langage formel inriac langage programmation inriac machine Turing inriac théorie complexité inriac Computational complexity Formal languages Machine theory Theoretische Informatik (DE-588)4196735-5 gnd rswk-swf Komplexitätstheorie (DE-588)4120591-1 gnd rswk-swf Automatentheorie (DE-588)4003953-5 gnd rswk-swf Formale Sprache (DE-588)4017848-1 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 1\p DE-604 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Sudkamp, Thomas A. Languages and machines an introduction to the theory of computer science Automates ram Complejidad computacional Complexités de calcul (informatique) ram Formele talen gtt Langages formels ram Lenguaje formal Programmeertalen gtt Teoría de las máquinas automate fini inriac décidabilité inriac grammaire formelle inriac langage formel inriac langage programmation inriac machine Turing inriac théorie complexité inriac Computational complexity Formal languages Machine theory Theoretische Informatik (DE-588)4196735-5 gnd Komplexitätstheorie (DE-588)4120591-1 gnd Automatentheorie (DE-588)4003953-5 gnd Formale Sprache (DE-588)4017848-1 gnd |
| subject_GND | (DE-588)4196735-5 (DE-588)4120591-1 (DE-588)4003953-5 (DE-588)4017848-1 |
| 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 ram Complejidad computacional Complexités de calcul (informatique) ram Formele talen gtt Langages formels ram Lenguaje formal Programmeertalen gtt Teoría de las máquinas automate fini inriac décidabilité inriac grammaire formelle inriac langage formel inriac langage programmation inriac machine Turing inriac théorie complexité inriac Computational complexity Formal languages Machine theory Theoretische Informatik (DE-588)4196735-5 gnd Komplexitätstheorie (DE-588)4120591-1 gnd Automatentheorie (DE-588)4003953-5 gnd Formale Sprache (DE-588)4017848-1 gnd |
| topic_facet | Automates Complejidad computacional Complexités de calcul (informatique) Formele talen Langages formels Lenguaje formal Programmeertalen Teoría de las máquinas automate fini décidabilité grammaire formelle langage formel langage programmation machine Turing théorie complexité Computational complexity Formal languages Machine theory Theoretische Informatik Komplexitätstheorie Automatentheorie Formale Sprache |
| work_keys_str_mv | AT sudkampthomasa languagesandmachinesanintroductiontothetheoryofcomputerscience |