On the time and tape complexity of languages:
We investigate the followin
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Ithaca, New York
1973
|
| Schriftenreihe: | Cornell University <Ithaca, NY> / Department of Computer Science: Technical report
182 |
| Schlagworte: | |
| Zusammenfassung: | We investigate the followin (1) the relationship between the classes of languages accepted by deterministic and nondeterministic polynomial time bounded Turing machines (2) the relationship between the classes of languages accepted by deterministic and nondeterministic linear bounded automata |
| Beschreibung: | Zugl.: Ithaca, NY, Cornell Univ., Diss. |
| Beschreibung: | VI, 92 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009877521 | ||
| 003 | DE-604 | ||
| 005 | 19941104 | ||
| 007 | t | ||
| 008 | 941104s1973 m||| 00||| engod | ||
| 035 | |a (OCoLC)3705205 | ||
| 035 | |a (DE-599)BVBBV009877521 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 082 | 0 | |a 510.782 |b H94o | |
| 100 | 1 | |a Hunt, Harry B. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a On the time and tape complexity of languages |c Harry Bowen Hunt |
| 264 | 1 | |a Ithaca, New York |c 1973 | |
| 300 | |a VI, 92 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Cornell University <Ithaca, NY> / Department of Computer Science: Technical report |v 182 | |
| 500 | |a Zugl.: Ithaca, NY, Cornell Univ., Diss. | ||
| 520 | 3 | |a We investigate the followin | |
| 520 | 3 | |a (1) the relationship between the classes of languages accepted by deterministic and nondeterministic polynomial time bounded Turing machines | |
| 520 | 3 | |a (2) the relationship between the classes of languages accepted by deterministic and nondeterministic linear bounded automata | |
| 650 | 4 | |a Combinatorial analysis | |
| 650 | 4 | |a Computational complexity | |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 810 | 2 | |a Department of Computer Science: Technical report |t Cornell University <Ithaca, NY> |v 182 |w (DE-604)BV006185504 |9 182 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006542268 | ||
Datensatz im Suchindex
| _version_ | 1804124237912342528 |
|---|---|
| any_adam_object | |
| author | Hunt, Harry B. |
| author_facet | Hunt, Harry B. |
| author_role | aut |
| author_sort | Hunt, Harry B. |
| author_variant | h b h hb hbh |
| building | Verbundindex |
| bvnumber | BV009877521 |
| ctrlnum | (OCoLC)3705205 (DE-599)BVBBV009877521 |
| dewey-full | 510.782 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 510 - Mathematics |
| dewey-raw | 510.782 |
| dewey-search | 510.782 |
| dewey-sort | 3510.782 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01455nam a2200361 cb4500</leader><controlfield tag="001">BV009877521</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19941104 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">941104s1973 m||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)3705205</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009877521</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></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">510.782</subfield><subfield code="b">H94o</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Hunt, Harry B.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">On the time and tape complexity of languages</subfield><subfield code="c">Harry Bowen Hunt</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Ithaca, New York</subfield><subfield code="c">1973</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">VI, 92 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="1" ind2=" "><subfield code="a">Cornell University <Ithaca, NY> / Department of Computer Science: Technical report</subfield><subfield code="v">182</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Zugl.: Ithaca, NY, Cornell Univ., Diss.</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">We investigate the followin</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">(1) the relationship between the classes of languages accepted by deterministic and nondeterministic polynomial time bounded Turing machines</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">(2) the relationship between the classes of languages accepted by deterministic and nondeterministic linear bounded automata</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Combinatorial analysis</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4113937-9</subfield><subfield code="a">Hochschulschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Computer Science: Technical report</subfield><subfield code="t">Cornell University <Ithaca, NY></subfield><subfield code="v">182</subfield><subfield code="w">(DE-604)BV006185504</subfield><subfield code="9">182</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006542268</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV009877521 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:42:29Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006542268 |
| oclc_num | 3705205 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | VI, 92 S. |
| publishDate | 1973 |
| publishDateSearch | 1973 |
| publishDateSort | 1973 |
| record_format | marc |
| series2 | Cornell University <Ithaca, NY> / Department of Computer Science: Technical report |
| spelling | Hunt, Harry B. Verfasser aut On the time and tape complexity of languages Harry Bowen Hunt Ithaca, New York 1973 VI, 92 S. txt rdacontent n rdamedia nc rdacarrier Cornell University <Ithaca, NY> / Department of Computer Science: Technical report 182 Zugl.: Ithaca, NY, Cornell Univ., Diss. We investigate the followin (1) the relationship between the classes of languages accepted by deterministic and nondeterministic polynomial time bounded Turing machines (2) the relationship between the classes of languages accepted by deterministic and nondeterministic linear bounded automata Combinatorial analysis Computational complexity (DE-588)4113937-9 Hochschulschrift gnd-content Department of Computer Science: Technical report Cornell University <Ithaca, NY> 182 (DE-604)BV006185504 182 |
| spellingShingle | Hunt, Harry B. On the time and tape complexity of languages Combinatorial analysis Computational complexity |
| subject_GND | (DE-588)4113937-9 |
| title | On the time and tape complexity of languages |
| title_auth | On the time and tape complexity of languages |
| title_exact_search | On the time and tape complexity of languages |
| title_full | On the time and tape complexity of languages Harry Bowen Hunt |
| title_fullStr | On the time and tape complexity of languages Harry Bowen Hunt |
| title_full_unstemmed | On the time and tape complexity of languages Harry Bowen Hunt |
| title_short | On the time and tape complexity of languages |
| title_sort | on the time and tape complexity of languages |
| topic | Combinatorial analysis Computational complexity |
| topic_facet | Combinatorial analysis Computational complexity Hochschulschrift |
| volume_link | (DE-604)BV006185504 |
| work_keys_str_mv | AT huntharryb onthetimeandtapecomplexityoflanguages |