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
1988
|
Schriftenreihe: | Addison-Wesley series in computer science
|
Schlagworte: | |
Beschreibung: | Literaturangaben |
Beschreibung: | XV, 444 S. graph. Darst. |
ISBN: | 0201157683 |
Internformat
MARC
LEADER | 00000nam a2200000 c 4500 | ||
---|---|---|---|
001 | BV002212749 | ||
003 | DE-604 | ||
005 | 19940627 | ||
007 | t | ||
008 | 890928s1988 d||| |||| 00||| eng d | ||
020 | |a 0201157683 |9 0-201-15768-3 | ||
035 | |a (OCoLC)16525395 | ||
035 | |a (DE-599)BVBBV002212749 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a eng | |
049 | |a DE-91G |a DE-384 |a DE-355 |a DE-19 |a DE-706 |a DE-188 | ||
050 | 0 | |a QA267.3 | |
082 | 0 | |a 004 |2 19 | |
084 | |a ES 900 |0 (DE-625)27926: |2 rvk | ||
084 | |a ST 110 |0 (DE-625)143583: |2 rvk | ||
084 | |a DAT 500f |2 stub | ||
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 |
264 | 1 | |a Reading, Mass. u.a. |b Addison-Wesley |c 1988 | |
300 | |a XV, 444 S. |b graph. Darst. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 0 | |a Addison-Wesley series in computer science | |
500 | |a Literaturangaben | ||
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 Formale Sprache |0 (DE-588)4017848-1 |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 |
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-001453283 | ||
883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk |
Datensatz im Suchindex
_version_ | 1804116667040530432 |
---|---|
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 | BV002212749 |
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 | ES 900 ST 110 |
classification_tum | DAT 500f |
ctrlnum | (OCoLC)16525395 (DE-599)BVBBV002212749 |
dewey-full | 004 |
dewey-hundreds | 000 - Computer science, information, general works |
dewey-ones | 004 - Computer science |
dewey-raw | 004 |
dewey-search | 004 |
dewey-sort | 14 |
dewey-tens | 000 - Computer science, information, general works |
discipline | Informatik Sprachwissenschaft Literaturwissenschaft |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01809nam a2200505 c 4500</leader><controlfield tag="001">BV002212749</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19940627 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">890928s1988 d||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0201157683</subfield><subfield code="9">0-201-15768-3</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)16525395</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV002212749</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-91G</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-355</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-188</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA267.3</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004</subfield><subfield code="2">19</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ES 900</subfield><subfield code="0">(DE-625)27926:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 110</subfield><subfield code="0">(DE-625)143583:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 500f</subfield><subfield code="2">stub</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="264" ind1=" " ind2="1"><subfield code="a">Reading, Mass. u.a.</subfield><subfield code="b">Addison-Wesley</subfield><subfield code="c">1988</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XV, 444 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">Addison-Wesley series in computer science</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Literaturangaben</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">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">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="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-001453283</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.BV002212749 |
illustrated | Illustrated |
indexdate | 2024-07-09T15:42:09Z |
institution | BVB |
isbn | 0201157683 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-001453283 |
oclc_num | 16525395 |
open_access_boolean | |
owner | DE-91G DE-BY-TUM DE-384 DE-355 DE-BY-UBR DE-19 DE-BY-UBM DE-706 DE-188 |
owner_facet | DE-91G DE-BY-TUM DE-384 DE-355 DE-BY-UBR DE-19 DE-BY-UBM DE-706 DE-188 |
physical | XV, 444 S. graph. Darst. |
publishDate | 1988 |
publishDateSearch | 1988 |
publishDateSort | 1988 |
publisher | Addison-Wesley |
record_format | marc |
series2 | Addison-Wesley series in computer science |
spelling | Sudkamp, Thomas A. Verfasser aut Languages and machines an introduction to the theory of computer science Thomas A. Sudkamp Reading, Mass. u.a. Addison-Wesley 1988 XV, 444 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Addison-Wesley series in computer science Literaturangaben Computational complexity Formal languages Machine theory Theoretische Informatik (DE-588)4196735-5 gnd rswk-swf Formale Sprache (DE-588)4017848-1 gnd rswk-swf Komplexitätstheorie (DE-588)4120591-1 gnd rswk-swf Automatentheorie (DE-588)4003953-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 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 Computational complexity Formal languages Machine theory Theoretische Informatik (DE-588)4196735-5 gnd Formale Sprache (DE-588)4017848-1 gnd Komplexitätstheorie (DE-588)4120591-1 gnd Automatentheorie (DE-588)4003953-5 gnd |
subject_GND | (DE-588)4196735-5 (DE-588)4017848-1 (DE-588)4120591-1 (DE-588)4003953-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 | Computational complexity Formal languages Machine theory Theoretische Informatik (DE-588)4196735-5 gnd Formale Sprache (DE-588)4017848-1 gnd Komplexitätstheorie (DE-588)4120591-1 gnd Automatentheorie (DE-588)4003953-5 gnd |
topic_facet | Computational complexity Formal languages Machine theory Theoretische Informatik Formale Sprache Komplexitätstheorie Automatentheorie |
work_keys_str_mv | AT sudkampthomasa languagesandmachinesanintroductiontothetheoryofcomputerscience |