Counter-free automata:
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Cambridge, Mass. [u.a.]
MIT Press
1971
|
| Schriftenreihe: | Research monograph / Massachusetts Institute of Technology
65 |
| Schlagworte: | |
| Beschreibung: | 163 S. |
| ISBN: | 0262130769 |
Internformat
MARC
| LEADER | 00000nam a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV022063270 | ||
| 003 | DE-604 | ||
| 005 | 20040301000000.0 | ||
| 007 | t | ||
| 008 | 960214s1971 |||| 00||| eng d | ||
| 020 | |a 0262130769 |9 0-262-13076-9 | ||
| 035 | |a (OCoLC)215165 | ||
| 035 | |a (DE-599)BVBBV022063270 | ||
| 040 | |a DE-604 |b ger | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-706 | ||
| 050 | 0 | |a QA267.5.S4 | |
| 082 | 0 | |a 629.8/91 | |
| 082 | 0 | |a 629.8/92 |2 18 | |
| 084 | |a ST 130 |0 (DE-625)143588: |2 rvk | ||
| 084 | |a ST 150 |0 (DE-625)143594: |2 rvk | ||
| 100 | 1 | |a MacNaughton, Robert |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Counter-free automata |c Robert McNaughton ; Seymour Papert |
| 264 | 1 | |a Cambridge, Mass. [u.a.] |b MIT Press |c 1971 | |
| 300 | |a 163 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Research monograph / Massachusetts Institute of Technology |v 65 | |
| 650 | 7 | |a EVENEMENT REGULIER |2 inriac | |
| 650 | 7 | |a MONOIDE SYNTACTIQUE |2 inriac | |
| 650 | 4 | |a Machines séquentielles (Théorie) | |
| 650 | 7 | |a Machines séquentielles, Théorie des |2 ram | |
| 650 | 7 | |a expression régulière |2 inriac | |
| 650 | 7 | |a logique symbolique |2 inriac | |
| 650 | 7 | |a réseau transmission |2 inriac | |
| 650 | 7 | |a théorie automate |2 inriac | |
| 650 | 4 | |a Sequential machine theory | |
| 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 Automatentheorie |0 (DE-588)4003953-5 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Formale Sprache |0 (DE-588)4017848-1 |D s |
| 689 | 1 | |8 1\p |5 DE-604 | |
| 700 | 1 | |a Papert, Seymour |d 1928-2016 |e Verfasser |0 (DE-588)136174604 |4 aut | |
| 810 | 2 | |a Massachusetts Institute of Technology |t Research monograph |v 65 |w (DE-604)BV002783678 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-015278035 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
Datensatz im Suchindex
| _version_ | 1804136039029145600 |
|---|---|
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author | MacNaughton, Robert Papert, Seymour 1928-2016 |
| author_GND | (DE-588)136174604 |
| author_facet | MacNaughton, Robert Papert, Seymour 1928-2016 |
| author_role | aut aut |
| author_sort | MacNaughton, Robert |
| author_variant | r m rm s p sp |
| building | Verbundindex |
| bvnumber | BV022063270 |
| callnumber-first | Q - Science |
| callnumber-label | QA267 |
| callnumber-raw | QA267.5.S4 |
| callnumber-search | QA267.5.S4 |
| callnumber-sort | QA 3267.5 S4 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | ST 130 ST 150 |
| ctrlnum | (OCoLC)215165 (DE-599)BVBBV022063270 |
| dewey-full | 629.8/91 629.8/92 |
| dewey-hundreds | 600 - Technology (Applied sciences) |
| dewey-ones | 629 - Other branches of engineering |
| dewey-raw | 629.8/91 629.8/92 |
| dewey-search | 629.8/91 629.8/92 |
| dewey-sort | 3629.8 291 |
| dewey-tens | 620 - Engineering and allied operations |
| discipline | Informatik Mess-/Steuerungs-/Regelungs-/Automatisierungstechnik / Mechatronik |
| discipline_str_mv | Informatik Mess-/Steuerungs-/Regelungs-/Automatisierungstechnik / Mechatronik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01921nam a2200541zcb4500</leader><controlfield tag="001">BV022063270</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20040301000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960214s1971 |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0262130769</subfield><subfield code="9">0-262-13076-9</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)215165</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV022063270</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.5.S4</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">629.8/91</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">629.8/92</subfield><subfield code="2">18</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="084" ind1=" " ind2=" "><subfield code="a">ST 150</subfield><subfield code="0">(DE-625)143594:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">MacNaughton, Robert</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Counter-free automata</subfield><subfield code="c">Robert McNaughton ; Seymour Papert</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge, Mass. [u.a.]</subfield><subfield code="b">MIT Press</subfield><subfield code="c">1971</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">163 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">Research monograph / Massachusetts Institute of Technology</subfield><subfield code="v">65</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">EVENEMENT REGULIER</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">MONOIDE SYNTACTIQUE</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Machines séquentielles (Théorie)</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Machines séquentielles, Théorie des</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">expression régulière</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">logique symbolique</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">réseau transmission</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">théorie automate</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Sequential machine theory</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">Automatentheorie</subfield><subfield code="0">(DE-588)4003953-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=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Papert, Seymour</subfield><subfield code="d">1928-2016</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)136174604</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Massachusetts Institute of Technology</subfield><subfield code="t">Research monograph</subfield><subfield code="v">65</subfield><subfield code="w">(DE-604)BV002783678</subfield><subfield code="9"></subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-015278035</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.BV022063270 |
| illustrated | Not Illustrated |
| index_date | 2024-07-02T16:13:39Z |
| indexdate | 2024-07-09T20:50:03Z |
| institution | BVB |
| isbn | 0262130769 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-015278035 |
| oclc_num | 215165 |
| open_access_boolean | |
| owner | DE-706 |
| owner_facet | DE-706 |
| physical | 163 S. |
| publishDate | 1971 |
| publishDateSearch | 1971 |
| publishDateSort | 1971 |
| publisher | MIT Press |
| record_format | marc |
| series2 | Research monograph / Massachusetts Institute of Technology |
| spelling | MacNaughton, Robert Verfasser aut Counter-free automata Robert McNaughton ; Seymour Papert Cambridge, Mass. [u.a.] MIT Press 1971 163 S. txt rdacontent n rdamedia nc rdacarrier Research monograph / Massachusetts Institute of Technology 65 EVENEMENT REGULIER inriac MONOIDE SYNTACTIQUE inriac Machines séquentielles (Théorie) Machines séquentielles, Théorie des ram expression régulière inriac logique symbolique inriac réseau transmission inriac théorie automate inriac Sequential machine theory Automatentheorie (DE-588)4003953-5 gnd rswk-swf Formale Sprache (DE-588)4017848-1 gnd rswk-swf Automatentheorie (DE-588)4003953-5 s DE-604 Formale Sprache (DE-588)4017848-1 s 1\p DE-604 Papert, Seymour 1928-2016 Verfasser (DE-588)136174604 aut Massachusetts Institute of Technology Research monograph 65 (DE-604)BV002783678 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | MacNaughton, Robert Papert, Seymour 1928-2016 Counter-free automata EVENEMENT REGULIER inriac MONOIDE SYNTACTIQUE inriac Machines séquentielles (Théorie) Machines séquentielles, Théorie des ram expression régulière inriac logique symbolique inriac réseau transmission inriac théorie automate inriac Sequential machine theory Automatentheorie (DE-588)4003953-5 gnd Formale Sprache (DE-588)4017848-1 gnd |
| subject_GND | (DE-588)4003953-5 (DE-588)4017848-1 |
| title | Counter-free automata |
| title_auth | Counter-free automata |
| title_exact_search | Counter-free automata |
| title_exact_search_txtP | Counter-free automata |
| title_full | Counter-free automata Robert McNaughton ; Seymour Papert |
| title_fullStr | Counter-free automata Robert McNaughton ; Seymour Papert |
| title_full_unstemmed | Counter-free automata Robert McNaughton ; Seymour Papert |
| title_short | Counter-free automata |
| title_sort | counter free automata |
| topic | EVENEMENT REGULIER inriac MONOIDE SYNTACTIQUE inriac Machines séquentielles (Théorie) Machines séquentielles, Théorie des ram expression régulière inriac logique symbolique inriac réseau transmission inriac théorie automate inriac Sequential machine theory Automatentheorie (DE-588)4003953-5 gnd Formale Sprache (DE-588)4017848-1 gnd |
| topic_facet | EVENEMENT REGULIER MONOIDE SYNTACTIQUE Machines séquentielles (Théorie) Machines séquentielles, Théorie des expression régulière logique symbolique réseau transmission théorie automate Sequential machine theory Automatentheorie Formale Sprache |
| volume_link | (DE-604)BV002783678 |
| work_keys_str_mv | AT macnaughtonrobert counterfreeautomata AT papertseymour counterfreeautomata |