K+1 heads are better than K:
Gespeichert in:
| Beteiligte Personen: | , |
|---|---|
| Format: | Buch |
| Sprache: | Englisch |
| Veröffentlicht: |
Cambridge, Mass.
Massachusetts Inst. of Technology, Lab. for Computer Science
1976
|
| Schlagwörter: | |
| Abstract: | There are languages which can be recognized by a deterministic (k+1)-headed one-way finite automaton but which cannot be recognized by a k-headed one-way (deterministic or non-deterministic) finite automaton. Furthermore, there is a language accepted by a k-headed nondeterministic finite automaton which is accepted by no k-headed deterministic finite automaton. (Author). |
| Umfang: | 8 S. |
Internformat
MARC
| LEADER | 00000nam a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV021882357 | ||
| 003 | DE-604 | ||
| 005 | 20040229000000.0 | ||
| 007 | t| | ||
| 008 | 890126s1976 xx |||| 00||| eng d | ||
| 035 | |a (OCoLC)227430688 | ||
| 035 | |a (DE-599)BVBBV021882357 | ||
| 040 | |a DE-604 |b ger | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-706 | ||
| 088 | |a MIT/LCS/TM-75 | ||
| 100 | 1 | |a Yao, Andrew C. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a K+1 heads are better than K |c A. C. Yao ; R. L. Rivest |
| 246 | 1 | 3 | |a K plus one heads are better than K |
| 264 | 1 | |a Cambridge, Mass. |b Massachusetts Inst. of Technology, Lab. for Computer Science |c 1976 | |
| 300 | |a 8 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 520 | 3 | |a There are languages which can be recognized by a deterministic (k+1)-headed one-way finite automaton but which cannot be recognized by a k-headed one-way (deterministic or non-deterministic) finite automaton. Furthermore, there is a language accepted by a k-headed nondeterministic finite automaton which is accepted by no k-headed deterministic finite automaton. (Author). | |
| 650 | 7 | |a Automata |2 dtict | |
| 650 | 7 | |a Computations |2 dtict | |
| 650 | 7 | |a Computer Hardware |2 scgdst | |
| 650 | 7 | |a Configurations |2 dtict | |
| 650 | 7 | |a Input output processing |2 dtict | |
| 650 | 7 | |a Numerical Mathematics |2 scgdst | |
| 650 | 7 | |a Reading machines |2 dtict | |
| 650 | 7 | |a Sequences |2 dtict | |
| 650 | 7 | |a Theorems |2 dtict | |
| 650 | 7 | |a Words(language) |2 dtict | |
| 650 | 0 | 7 | |a Endlicher Automat |0 (DE-588)4224518-7 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Endlicher Automat |0 (DE-588)4224518-7 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Rivest, Ronald L. |e Verfasser |4 aut | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-015097713 | |
Datensatz im Suchindex
| _version_ | 1818963364953456640 |
|---|---|
| any_adam_object | |
| author | Yao, Andrew C. Rivest, Ronald L. |
| author_facet | Yao, Andrew C. Rivest, Ronald L. |
| author_role | aut aut |
| author_sort | Yao, Andrew C. |
| author_variant | a c y ac acy r l r rl rlr |
| building | Verbundindex |
| bvnumber | BV021882357 |
| ctrlnum | (OCoLC)227430688 (DE-599)BVBBV021882357 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01745nam a2200445zc 4500</leader><controlfield tag="001">BV021882357</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20040229000000.0</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">890126s1976 xx |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)227430688</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV021882357</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="088" ind1=" " ind2=" "><subfield code="a">MIT/LCS/TM-75</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Yao, Andrew C.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">K+1 heads are better than K</subfield><subfield code="c">A. C. Yao ; R. L. Rivest</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">K plus one heads are better than K</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge, Mass.</subfield><subfield code="b">Massachusetts Inst. of Technology, Lab. for Computer Science</subfield><subfield code="c">1976</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">8 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="520" ind1="3" ind2=" "><subfield code="a">There are languages which can be recognized by a deterministic (k+1)-headed one-way finite automaton but which cannot be recognized by a k-headed one-way (deterministic or non-deterministic) finite automaton. Furthermore, there is a language accepted by a k-headed nondeterministic finite automaton which is accepted by no k-headed deterministic finite automaton. (Author).</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Automata</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computations</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer Hardware</subfield><subfield code="2">scgdst</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Configurations</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Input output processing</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Numerical Mathematics</subfield><subfield code="2">scgdst</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Reading machines</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Sequences</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Theorems</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Words(language)</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Endlicher Automat</subfield><subfield code="0">(DE-588)4224518-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Endlicher Automat</subfield><subfield code="0">(DE-588)4224518-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Rivest, Ronald L.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-015097713</subfield></datafield></record></collection> |
| id | DE-604.BV021882357 |
| illustrated | Not Illustrated |
| indexdate | 2024-12-20T12:44:03Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-015097713 |
| oclc_num | 227430688 |
| open_access_boolean | |
| owner | DE-706 |
| owner_facet | DE-706 |
| physical | 8 S. |
| publishDate | 1976 |
| publishDateSearch | 1976 |
| publishDateSort | 1976 |
| publisher | Massachusetts Inst. of Technology, Lab. for Computer Science |
| record_format | marc |
| spelling | Yao, Andrew C. Verfasser aut K+1 heads are better than K A. C. Yao ; R. L. Rivest K plus one heads are better than K Cambridge, Mass. Massachusetts Inst. of Technology, Lab. for Computer Science 1976 8 S. txt rdacontent n rdamedia nc rdacarrier There are languages which can be recognized by a deterministic (k+1)-headed one-way finite automaton but which cannot be recognized by a k-headed one-way (deterministic or non-deterministic) finite automaton. Furthermore, there is a language accepted by a k-headed nondeterministic finite automaton which is accepted by no k-headed deterministic finite automaton. (Author). Automata dtict Computations dtict Computer Hardware scgdst Configurations dtict Input output processing dtict Numerical Mathematics scgdst Reading machines dtict Sequences dtict Theorems dtict Words(language) dtict Endlicher Automat (DE-588)4224518-7 gnd rswk-swf Endlicher Automat (DE-588)4224518-7 s DE-604 Rivest, Ronald L. Verfasser aut |
| spellingShingle | Yao, Andrew C. Rivest, Ronald L. K+1 heads are better than K Automata dtict Computations dtict Computer Hardware scgdst Configurations dtict Input output processing dtict Numerical Mathematics scgdst Reading machines dtict Sequences dtict Theorems dtict Words(language) dtict Endlicher Automat (DE-588)4224518-7 gnd |
| subject_GND | (DE-588)4224518-7 |
| title | K+1 heads are better than K |
| title_alt | K plus one heads are better than K |
| title_auth | K+1 heads are better than K |
| title_exact_search | K+1 heads are better than K |
| title_full | K+1 heads are better than K A. C. Yao ; R. L. Rivest |
| title_fullStr | K+1 heads are better than K A. C. Yao ; R. L. Rivest |
| title_full_unstemmed | K+1 heads are better than K A. C. Yao ; R. L. Rivest |
| title_short | K+1 heads are better than K |
| title_sort | k 1 heads are better than k |
| topic | Automata dtict Computations dtict Computer Hardware scgdst Configurations dtict Input output processing dtict Numerical Mathematics scgdst Reading machines dtict Sequences dtict Theorems dtict Words(language) dtict Endlicher Automat (DE-588)4224518-7 gnd |
| topic_facet | Automata Computations Computer Hardware Configurations Input output processing Numerical Mathematics Reading machines Sequences Theorems Words(language) Endlicher Automat |
| work_keys_str_mv | AT yaoandrewc k1headsarebetterthank AT rivestronaldl k1headsarebetterthank AT yaoandrewc kplusoneheadsarebetterthank AT rivestronaldl kplusoneheadsarebetterthank |