Computation and automata:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Cambridge [Cambridgeshire]
Cambridge University Press
1985
|
| Schriftenreihe: | Encyclopedia of mathematics and its applications
v. 25 |
| Schlagworte: | |
| Online-Zugang: | FAW01 FAW02 Volltext |
| Beschreibung: | Includes bibliographical references (p. 269-277) and index |
| Beschreibung: | 1 Online-Ressource (xiii, 284 p.) |
| ISBN: | 0521302455 1107087589 1107325633 9780521302456 9781107087583 9781107325630 |
Internformat
MARC
| LEADER | 00000nmm a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV043059565 | ||
| 003 | DE-604 | ||
| 005 | 20220114 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 151126s1985 |||| o||u| ||||||eng d | ||
| 020 | |a 0521302455 |9 0-521-30245-5 | ||
| 020 | |a 1107087589 |c electronic bk. |9 1-107-08758-9 | ||
| 020 | |a 1107325633 |c electronic bk. |9 1-107-32563-3 | ||
| 020 | |a 9780521302456 |9 978-0-521-30245-6 | ||
| 020 | |a 9781107087583 |c electronic bk. |9 978-1-107-08758-3 | ||
| 020 | |a 9781107325630 |c electronic bk. |9 978-1-107-32563-0 | ||
| 035 | |a (OCoLC)852898533 | ||
| 035 | |a (DE-599)BVBBV043059565 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-1046 |a DE-1047 | ||
| 082 | 0 | |a 511 |2 22 | |
| 100 | 1 | |a Salomaa, Arto |d 1934- |e Verfasser |0 (DE-588)121031764 |4 aut | |
| 245 | 1 | 0 | |a Computation and automata |c Arto Salomaa |
| 264 | 1 | |a Cambridge [Cambridgeshire] |b Cambridge University Press |c 1985 | |
| 300 | |a 1 Online-Ressource (xiii, 284 p.) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a Encyclopedia of mathematics and its applications |v v. 25 | |
| 500 | |a Includes bibliographical references (p. 269-277) and index | ||
| 650 | 4 | |a problème décision | |
| 650 | 4 | |a machine séquentielle | |
| 650 | 4 | |a cryptographie | |
| 650 | 4 | |a théorie langage | |
| 650 | 4 | |a théorie automate | |
| 650 | 4 | |a automate fini | |
| 650 | 4 | |a langage formel | |
| 650 | 4 | |a machine Turing | |
| 650 | 4 | |a fonction récursive | |
| 650 | 4 | |a complexité calcul | |
| 650 | 4 | |a Fonctions calculables | |
| 650 | 4 | |a Complexité de calcul (Informatique) | |
| 650 | 4 | |a Machines séquentielles, Théorie des | |
| 650 | 7 | |a Formale Sprache |2 swd | |
| 650 | 7 | |a Automatentheorie |2 swd | |
| 650 | 7 | |a Komplexitätstheorie |2 swd | |
| 650 | 7 | |a Complexité de calcul (informatique) |2 ram | |
| 650 | 7 | |a Automates mathématiques, Théorie des |2 ram | |
| 650 | 7 | |a Machines séquentielles, Théorie des |2 ram | |
| 650 | 7 | |a MATHEMATICS / General |2 bisacsh | |
| 650 | 7 | |a Computable functions |2 fast | |
| 650 | 7 | |a Computational complexity |2 fast | |
| 650 | 7 | |a Sequential machine theory |2 fast | |
| 650 | 4 | |a Computable functions | |
| 650 | 4 | |a Computational complexity | |
| 650 | 4 | |a Sequential machine theory | |
| 650 | 0 | 7 | |a Berechenbarkeit |0 (DE-588)4138368-0 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Mathematik |0 (DE-588)4037944-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Informatik |0 (DE-588)4026894-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Automatentheorie |0 (DE-588)4003953-5 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Informatik |0 (DE-588)4026894-9 |D s |
| 689 | 0 | 1 | |a Mathematik |0 (DE-588)4037944-9 |D s |
| 689 | 0 | |8 1\p |5 DE-604 | |
| 689 | 1 | 0 | |a Automatentheorie |0 (DE-588)4003953-5 |D s |
| 689 | 1 | |8 2\p |5 DE-604 | |
| 689 | 2 | 0 | |a Berechenbarkeit |0 (DE-588)4138368-0 |D s |
| 689 | 2 | |8 3\p |5 DE-604 | |
| 856 | 4 | 0 | |u http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=570392 |x Aggregator |3 Volltext |
| 912 | |a ZDB-4-EBA | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-028483757 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 2\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 3\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 966 | e | |u http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=570392 |l FAW01 |p ZDB-4-EBA |q FAW_PDA_EBA |x Aggregator |3 Volltext | |
| 966 | e | |u http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=570392 |l FAW02 |p ZDB-4-EBA |q FAW_PDA_EBA |x Aggregator |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804175433425485824 |
|---|---|
| any_adam_object | |
| author | Salomaa, Arto 1934- |
| author_GND | (DE-588)121031764 |
| author_facet | Salomaa, Arto 1934- |
| author_role | aut |
| author_sort | Salomaa, Arto 1934- |
| author_variant | a s as |
| building | Verbundindex |
| bvnumber | BV043059565 |
| collection | ZDB-4-EBA |
| ctrlnum | (OCoLC)852898533 (DE-599)BVBBV043059565 |
| dewey-full | 511 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511 |
| dewey-search | 511 |
| dewey-sort | 3511 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03597nmm a2200877zcb4500</leader><controlfield tag="001">BV043059565</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20220114 </controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">151126s1985 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0521302455</subfield><subfield code="9">0-521-30245-5</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1107087589</subfield><subfield code="c">electronic bk.</subfield><subfield code="9">1-107-08758-9</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1107325633</subfield><subfield code="c">electronic bk.</subfield><subfield code="9">1-107-32563-3</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780521302456</subfield><subfield code="9">978-0-521-30245-6</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781107087583</subfield><subfield code="c">electronic bk.</subfield><subfield code="9">978-1-107-08758-3</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781107325630</subfield><subfield code="c">electronic bk.</subfield><subfield code="9">978-1-107-32563-0</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)852898533</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV043059565</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-1046</subfield><subfield code="a">DE-1047</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511</subfield><subfield code="2">22</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Salomaa, Arto</subfield><subfield code="d">1934-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)121031764</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Computation and automata</subfield><subfield code="c">Arto Salomaa</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge [Cambridgeshire]</subfield><subfield code="b">Cambridge University Press</subfield><subfield code="c">1985</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (xiii, 284 p.)</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">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Encyclopedia of mathematics and its applications</subfield><subfield code="v">v. 25</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references (p. 269-277) and index</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">problème décision</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">machine séquentielle</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">cryptographie</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">théorie langage</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">théorie automate</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">automate fini</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">langage formel</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">machine Turing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">fonction récursive</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">complexité calcul</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Fonctions calculables</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Complexité de calcul (Informatique)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Machines séquentielles, Théorie des</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Formale Sprache</subfield><subfield code="2">swd</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Automatentheorie</subfield><subfield code="2">swd</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Komplexitätstheorie</subfield><subfield code="2">swd</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Complexité de calcul (informatique)</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Automates mathématiques, Théorie des</subfield><subfield code="2">ram</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">MATHEMATICS / General</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computable functions</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computational complexity</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Sequential machine theory</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computable functions</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</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">Berechenbarkeit</subfield><subfield code="0">(DE-588)4138368-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Mathematik</subfield><subfield code="0">(DE-588)4037944-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Informatik</subfield><subfield code="0">(DE-588)4026894-9</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">Informatik</subfield><subfield code="0">(DE-588)4026894-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Mathematik</subfield><subfield code="0">(DE-588)4037944-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" 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="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Berechenbarkeit</subfield><subfield code="0">(DE-588)4138368-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="8">3\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=570392</subfield><subfield code="x">Aggregator</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-4-EBA</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-028483757</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><datafield tag="883" ind1="1" ind2=" "><subfield code="8">2\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><datafield tag="883" ind1="1" ind2=" "><subfield code="8">3\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><datafield tag="966" ind1="e" ind2=" "><subfield code="u">http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=570392</subfield><subfield code="l">FAW01</subfield><subfield code="p">ZDB-4-EBA</subfield><subfield code="q">FAW_PDA_EBA</subfield><subfield code="x">Aggregator</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=570392</subfield><subfield code="l">FAW02</subfield><subfield code="p">ZDB-4-EBA</subfield><subfield code="q">FAW_PDA_EBA</subfield><subfield code="x">Aggregator</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV043059565 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T07:16:13Z |
| institution | BVB |
| isbn | 0521302455 1107087589 1107325633 9780521302456 9781107087583 9781107325630 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-028483757 |
| oclc_num | 852898533 |
| open_access_boolean | |
| owner | DE-1046 DE-1047 |
| owner_facet | DE-1046 DE-1047 |
| physical | 1 Online-Ressource (xiii, 284 p.) |
| psigel | ZDB-4-EBA ZDB-4-EBA FAW_PDA_EBA |
| publishDate | 1985 |
| publishDateSearch | 1985 |
| publishDateSort | 1985 |
| publisher | Cambridge University Press |
| record_format | marc |
| series2 | Encyclopedia of mathematics and its applications |
| spelling | Salomaa, Arto 1934- Verfasser (DE-588)121031764 aut Computation and automata Arto Salomaa Cambridge [Cambridgeshire] Cambridge University Press 1985 1 Online-Ressource (xiii, 284 p.) txt rdacontent c rdamedia cr rdacarrier Encyclopedia of mathematics and its applications v. 25 Includes bibliographical references (p. 269-277) and index problème décision machine séquentielle cryptographie théorie langage théorie automate automate fini langage formel machine Turing fonction récursive complexité calcul Fonctions calculables Complexité de calcul (Informatique) Machines séquentielles, Théorie des Formale Sprache swd Automatentheorie swd Komplexitätstheorie swd Complexité de calcul (informatique) ram Automates mathématiques, Théorie des ram Machines séquentielles, Théorie des ram MATHEMATICS / General bisacsh Computable functions fast Computational complexity fast Sequential machine theory fast Computable functions Computational complexity Sequential machine theory Berechenbarkeit (DE-588)4138368-0 gnd rswk-swf Mathematik (DE-588)4037944-9 gnd rswk-swf Informatik (DE-588)4026894-9 gnd rswk-swf Automatentheorie (DE-588)4003953-5 gnd rswk-swf Informatik (DE-588)4026894-9 s Mathematik (DE-588)4037944-9 s 1\p DE-604 Automatentheorie (DE-588)4003953-5 s 2\p DE-604 Berechenbarkeit (DE-588)4138368-0 s 3\p DE-604 http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=570392 Aggregator Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 2\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 3\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Salomaa, Arto 1934- Computation and automata problème décision machine séquentielle cryptographie théorie langage théorie automate automate fini langage formel machine Turing fonction récursive complexité calcul Fonctions calculables Complexité de calcul (Informatique) Machines séquentielles, Théorie des Formale Sprache swd Automatentheorie swd Komplexitätstheorie swd Complexité de calcul (informatique) ram Automates mathématiques, Théorie des ram Machines séquentielles, Théorie des ram MATHEMATICS / General bisacsh Computable functions fast Computational complexity fast Sequential machine theory fast Computable functions Computational complexity Sequential machine theory Berechenbarkeit (DE-588)4138368-0 gnd Mathematik (DE-588)4037944-9 gnd Informatik (DE-588)4026894-9 gnd Automatentheorie (DE-588)4003953-5 gnd |
| subject_GND | (DE-588)4138368-0 (DE-588)4037944-9 (DE-588)4026894-9 (DE-588)4003953-5 |
| title | Computation and automata |
| title_auth | Computation and automata |
| title_exact_search | Computation and automata |
| title_full | Computation and automata Arto Salomaa |
| title_fullStr | Computation and automata Arto Salomaa |
| title_full_unstemmed | Computation and automata Arto Salomaa |
| title_short | Computation and automata |
| title_sort | computation and automata |
| topic | problème décision machine séquentielle cryptographie théorie langage théorie automate automate fini langage formel machine Turing fonction récursive complexité calcul Fonctions calculables Complexité de calcul (Informatique) Machines séquentielles, Théorie des Formale Sprache swd Automatentheorie swd Komplexitätstheorie swd Complexité de calcul (informatique) ram Automates mathématiques, Théorie des ram Machines séquentielles, Théorie des ram MATHEMATICS / General bisacsh Computable functions fast Computational complexity fast Sequential machine theory fast Computable functions Computational complexity Sequential machine theory Berechenbarkeit (DE-588)4138368-0 gnd Mathematik (DE-588)4037944-9 gnd Informatik (DE-588)4026894-9 gnd Automatentheorie (DE-588)4003953-5 gnd |
| topic_facet | problème décision machine séquentielle cryptographie théorie langage théorie automate automate fini langage formel machine Turing fonction récursive complexité calcul Fonctions calculables Complexité de calcul (Informatique) Machines séquentielles, Théorie des Formale Sprache Automatentheorie Komplexitätstheorie Complexité de calcul (informatique) Automates mathématiques, Théorie des MATHEMATICS / General Computable functions Computational complexity Sequential machine theory Berechenbarkeit Mathematik Informatik |
| url | http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=570392 |
| work_keys_str_mv | AT salomaaarto computationandautomata |