Theory of computation: formal languages, automata, and complexity
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Redwood City, Calif.
Benjamin/Cummings
1989
|
| Schriftenreihe: | Benjamin/Cummings series in computer science.
|
| Schlagworte: | |
| Beschreibung: | XII, 322 S. graph. Darst. |
| ISBN: | 0805301437 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV002219501 | ||
| 003 | DE-604 | ||
| 005 | 20010115 | ||
| 007 | t | ||
| 008 | 890928s1989 d||| |||| 00||| eng d | ||
| 020 | |a 0805301437 |9 0-8053-0143-7 | ||
| 035 | |a (OCoLC)18413272 | ||
| 035 | |a (DE-599)BVBBV002219501 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G |a DE-384 |a DE-473 |a DE-739 |a DE-355 |a DE-29T |a DE-19 |a DE-188 | ||
| 050 | 0 | |a QA267 | |
| 082 | 0 | |a 511 |2 19 | |
| 084 | |a ES 900 |0 (DE-625)27926: |2 rvk | ||
| 084 | |a ST 130 |0 (DE-625)143588: |2 rvk | ||
| 084 | |a DAT 500f |2 stub | ||
| 100 | 1 | |a Brookshear, J. Glenn |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Theory of computation |b formal languages, automata, and complexity |c J. Glenn Brookshear |
| 264 | 1 | |a Redwood City, Calif. |b Benjamin/Cummings |c 1989 | |
| 300 | |a XII, 322 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 0 | |a Benjamin/Cummings series in computer science. | |
| 650 | 4 | |a Automates mathématiques, Théorie des | |
| 650 | 7 | |a Automates mathématiques, Théorie des |2 ram | |
| 650 | 4 | |a Complexité de calcul (Informatique) | |
| 650 | 7 | |a Complexité de calcul (informatique) |2 ram | |
| 650 | 7 | |a Langages formels |2 ram | |
| 650 | 7 | |a automate fini |2 inriac | |
| 650 | 7 | |a complexité calcul |2 inriac | |
| 650 | 7 | |a langage algébrique |2 inriac | |
| 650 | 7 | |a langage formel |2 inriac | |
| 650 | 7 | |a machine Turing |2 inriac | |
| 650 | 7 | |a théorie calcul |2 inriac | |
| 650 | 7 | |a théorie machine |2 inriac | |
| 650 | 4 | |a Computational complexity | |
| 650 | 4 | |a Machine theory | |
| 650 | 0 | 7 | |a Komplexität |0 (DE-588)4135369-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Automatentheorie |0 (DE-588)4003953-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Computer |0 (DE-588)4070083-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 Theoretische Informatik |0 (DE-588)4196735-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)4151278-9 |a Einführung |2 gnd-content | |
| 689 | 0 | 0 | |a Theoretische Informatik |0 (DE-588)4196735-5 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |D s |
| 689 | 1 | |5 DE-604 | |
| 689 | 2 | 0 | |a Automatentheorie |0 (DE-588)4003953-5 |D s |
| 689 | 2 | |5 DE-604 | |
| 689 | 3 | 0 | |a Formale Sprache |0 (DE-588)4017848-1 |D s |
| 689 | 3 | |5 DE-604 | |
| 689 | 4 | 0 | |a Computer |0 (DE-588)4070083-5 |D s |
| 689 | 4 | |5 DE-604 | |
| 689 | 5 | 0 | |a Komplexität |0 (DE-588)4135369-9 |D s |
| 689 | 5 | |8 1\p |5 DE-604 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-001457711 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
Datensatz im Suchindex
| _version_ | 1804116673948549120 |
|---|---|
| any_adam_object | |
| author | Brookshear, J. Glenn |
| author_facet | Brookshear, J. Glenn |
| author_role | aut |
| author_sort | Brookshear, J. Glenn |
| author_variant | j g b jg jgb |
| building | Verbundindex |
| bvnumber | BV002219501 |
| callnumber-first | Q - Science |
| callnumber-label | QA267 |
| callnumber-raw | QA267 |
| callnumber-search | QA267 |
| callnumber-sort | QA 3267 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | ES 900 ST 130 |
| classification_tum | DAT 500f |
| ctrlnum | (OCoLC)18413272 (DE-599)BVBBV002219501 |
| 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 | Sprachwissenschaft Informatik Mathematik Literaturwissenschaft |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02681nam a2200733 c 4500</leader><controlfield tag="001">BV002219501</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20010115 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">890928s1989 d||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0805301437</subfield><subfield code="9">0-8053-0143-7</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)18413272</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV002219501</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</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-473</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-355</subfield><subfield code="a">DE-29T</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-188</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA267</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511</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 130</subfield><subfield code="0">(DE-625)143588:</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">Brookshear, J. Glenn</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Theory of computation</subfield><subfield code="b">formal languages, automata, and complexity</subfield><subfield code="c">J. Glenn Brookshear</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Redwood City, Calif.</subfield><subfield code="b">Benjamin/Cummings</subfield><subfield code="c">1989</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XII, 322 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">Benjamin/Cummings series in computer science.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Automates mathématiques, Théorie des</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="4"><subfield code="a">Complexité de calcul (Informatique)</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">Langages formels</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">automate fini</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">complexité calcul</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">langage algébrique</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">langage formel</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">machine Turing</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">théorie calcul</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">théorie machine</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</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">Komplexität</subfield><subfield code="0">(DE-588)4135369-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="650" ind1="0" ind2="7"><subfield code="a">Computer</subfield><subfield code="0">(DE-588)4070083-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">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">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="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4151278-9</subfield><subfield code="a">Einführung</subfield><subfield code="2">gnd-content</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">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="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" 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="2" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="3" 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="3" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="4" ind2="0"><subfield code="a">Computer</subfield><subfield code="0">(DE-588)4070083-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="4" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="5" ind2="0"><subfield code="a">Komplexität</subfield><subfield code="0">(DE-588)4135369-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="5" 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-001457711</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> |
| genre | (DE-588)4151278-9 Einführung gnd-content |
| genre_facet | Einführung |
| id | DE-604.BV002219501 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T15:42:15Z |
| institution | BVB |
| isbn | 0805301437 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-001457711 |
| oclc_num | 18413272 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM DE-384 DE-473 DE-BY-UBG DE-739 DE-355 DE-BY-UBR DE-29T DE-19 DE-BY-UBM DE-188 |
| owner_facet | DE-91G DE-BY-TUM DE-384 DE-473 DE-BY-UBG DE-739 DE-355 DE-BY-UBR DE-29T DE-19 DE-BY-UBM DE-188 |
| physical | XII, 322 S. graph. Darst. |
| publishDate | 1989 |
| publishDateSearch | 1989 |
| publishDateSort | 1989 |
| publisher | Benjamin/Cummings |
| record_format | marc |
| series2 | Benjamin/Cummings series in computer science. |
| spelling | Brookshear, J. Glenn Verfasser aut Theory of computation formal languages, automata, and complexity J. Glenn Brookshear Redwood City, Calif. Benjamin/Cummings 1989 XII, 322 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Benjamin/Cummings series in computer science. Automates mathématiques, Théorie des Automates mathématiques, Théorie des ram Complexité de calcul (Informatique) Complexité de calcul (informatique) ram Langages formels ram automate fini inriac complexité calcul inriac langage algébrique inriac langage formel inriac machine Turing inriac théorie calcul inriac théorie machine inriac Computational complexity Machine theory Komplexität (DE-588)4135369-9 gnd rswk-swf Automatentheorie (DE-588)4003953-5 gnd rswk-swf Computer (DE-588)4070083-5 gnd rswk-swf Formale Sprache (DE-588)4017848-1 gnd rswk-swf Theoretische Informatik (DE-588)4196735-5 gnd rswk-swf Komplexitätstheorie (DE-588)4120591-1 gnd rswk-swf (DE-588)4151278-9 Einführung gnd-content Theoretische Informatik (DE-588)4196735-5 s DE-604 Komplexitätstheorie (DE-588)4120591-1 s Automatentheorie (DE-588)4003953-5 s Formale Sprache (DE-588)4017848-1 s Computer (DE-588)4070083-5 s Komplexität (DE-588)4135369-9 s 1\p DE-604 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Brookshear, J. Glenn Theory of computation formal languages, automata, and complexity Automates mathématiques, Théorie des Automates mathématiques, Théorie des ram Complexité de calcul (Informatique) Complexité de calcul (informatique) ram Langages formels ram automate fini inriac complexité calcul inriac langage algébrique inriac langage formel inriac machine Turing inriac théorie calcul inriac théorie machine inriac Computational complexity Machine theory Komplexität (DE-588)4135369-9 gnd Automatentheorie (DE-588)4003953-5 gnd Computer (DE-588)4070083-5 gnd Formale Sprache (DE-588)4017848-1 gnd Theoretische Informatik (DE-588)4196735-5 gnd Komplexitätstheorie (DE-588)4120591-1 gnd |
| subject_GND | (DE-588)4135369-9 (DE-588)4003953-5 (DE-588)4070083-5 (DE-588)4017848-1 (DE-588)4196735-5 (DE-588)4120591-1 (DE-588)4151278-9 |
| title | Theory of computation formal languages, automata, and complexity |
| title_auth | Theory of computation formal languages, automata, and complexity |
| title_exact_search | Theory of computation formal languages, automata, and complexity |
| title_full | Theory of computation formal languages, automata, and complexity J. Glenn Brookshear |
| title_fullStr | Theory of computation formal languages, automata, and complexity J. Glenn Brookshear |
| title_full_unstemmed | Theory of computation formal languages, automata, and complexity J. Glenn Brookshear |
| title_short | Theory of computation |
| title_sort | theory of computation formal languages automata and complexity |
| title_sub | formal languages, automata, and complexity |
| topic | Automates mathématiques, Théorie des Automates mathématiques, Théorie des ram Complexité de calcul (Informatique) Complexité de calcul (informatique) ram Langages formels ram automate fini inriac complexité calcul inriac langage algébrique inriac langage formel inriac machine Turing inriac théorie calcul inriac théorie machine inriac Computational complexity Machine theory Komplexität (DE-588)4135369-9 gnd Automatentheorie (DE-588)4003953-5 gnd Computer (DE-588)4070083-5 gnd Formale Sprache (DE-588)4017848-1 gnd Theoretische Informatik (DE-588)4196735-5 gnd Komplexitätstheorie (DE-588)4120591-1 gnd |
| topic_facet | Automates mathématiques, Théorie des Complexité de calcul (Informatique) Complexité de calcul (informatique) Langages formels automate fini complexité calcul langage algébrique langage formel machine Turing théorie calcul théorie machine Computational complexity Machine theory Komplexität Automatentheorie Computer Formale Sprache Theoretische Informatik Komplexitätstheorie Einführung |
| work_keys_str_mv | AT brookshearjglenn theoryofcomputationformallanguagesautomataandcomplexity |