Finite automata, formal logic, and circuit complexity:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Boston ; Berlin [u.a.]
Birkhäuser
1994
|
| Schriftenreihe: | Progress in theoretical computer science
11 |
| Schlagworte: | |
| Beschreibung: | XII, 226 S. graph. Darst. |
| ISBN: | 3764337192 |
Internformat
MARC
| LEADER | 00000nam a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV023828300 | ||
| 003 | DE-604 | ||
| 005 | 20210730 | ||
| 007 | t | ||
| 008 | 951016s1994 d||| |||| 00||| eng d | ||
| 020 | |a 3764337192 |9 3-7643-3719-2 | ||
| 035 | |a (OCoLC)246881871 | ||
| 035 | |a (DE-599)BVBBV023828300 | ||
| 040 | |a DE-604 |b ger | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-634 |a DE-83 |a DE-188 | ||
| 084 | |a ST 130 |0 (DE-625)143588: |2 rvk | ||
| 100 | 1 | |a Straubing, Howard |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Finite automata, formal logic, and circuit complexity |c Howard Straubing |
| 264 | 1 | |a Boston ; Berlin [u.a.] |b Birkhäuser |c 1994 | |
| 300 | |a XII, 226 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Progress in theoretical computer science |v 11 | |
| 650 | 0 | 7 | |a Mathematische Logik |0 (DE-588)4037951-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Endlicher Automat |0 (DE-588)4224518-7 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Berechnungskomplexität |0 (DE-588)4134751-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Automatentheorie |0 (DE-588)4003953-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Logik |0 (DE-588)4036202-4 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Halbgruppentheorie |0 (DE-588)4288418-4 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Endlicher Automat |0 (DE-588)4224518-7 |D s |
| 689 | 0 | 1 | |a Mathematische Logik |0 (DE-588)4037951-6 |D s |
| 689 | 0 | 2 | |a Halbgruppentheorie |0 (DE-588)4288418-4 |D s |
| 689 | 0 | 3 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Automatentheorie |0 (DE-588)4003953-5 |D s |
| 689 | 1 | 1 | |a Logik |0 (DE-588)4036202-4 |D s |
| 689 | 1 | 2 | |a Halbgruppentheorie |0 (DE-588)4288418-4 |D s |
| 689 | 1 | 3 | |a Berechnungskomplexität |0 (DE-588)4134751-1 |D s |
| 689 | 1 | |8 1\p |5 DE-604 | |
| 830 | 0 | |a Progress in theoretical computer science |v 11 |w (DE-604)BV021856086 |9 11 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-017470474 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
Datensatz im Suchindex
| _version_ | 1804139027995033600 |
|---|---|
| any_adam_object | |
| author | Straubing, Howard |
| author_facet | Straubing, Howard |
| author_role | aut |
| author_sort | Straubing, Howard |
| author_variant | h s hs |
| building | Verbundindex |
| bvnumber | BV023828300 |
| classification_rvk | ST 130 |
| ctrlnum | (OCoLC)246881871 (DE-599)BVBBV023828300 |
| discipline | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02000nam a2200505zcb4500</leader><controlfield tag="001">BV023828300</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20210730 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">951016s1994 d||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3764337192</subfield><subfield code="9">3-7643-3719-2</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)246881871</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV023828300</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-634</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-188</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="100" ind1="1" ind2=" "><subfield code="a">Straubing, Howard</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Finite automata, formal logic, and circuit complexity</subfield><subfield code="c">Howard Straubing</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Boston ; Berlin [u.a.]</subfield><subfield code="b">Birkhäuser</subfield><subfield code="c">1994</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XII, 226 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="1" ind2=" "><subfield code="a">Progress in theoretical computer science</subfield><subfield code="v">11</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Mathematische Logik</subfield><subfield code="0">(DE-588)4037951-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</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="650" ind1="0" ind2="7"><subfield code="a">Berechnungskomplexität</subfield><subfield code="0">(DE-588)4134751-1</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">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="650" ind1="0" ind2="7"><subfield code="a">Logik</subfield><subfield code="0">(DE-588)4036202-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Halbgruppentheorie</subfield><subfield code="0">(DE-588)4288418-4</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="1"><subfield code="a">Mathematische Logik</subfield><subfield code="0">(DE-588)4037951-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Halbgruppentheorie</subfield><subfield code="0">(DE-588)4288418-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="3"><subfield code="a">Komplexitätstheorie</subfield><subfield code="0">(DE-588)4120591-1</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">Automatentheorie</subfield><subfield code="0">(DE-588)4003953-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Logik</subfield><subfield code="0">(DE-588)4036202-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="2"><subfield code="a">Halbgruppentheorie</subfield><subfield code="0">(DE-588)4288418-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="3"><subfield code="a">Berechnungskomplexität</subfield><subfield code="0">(DE-588)4134751-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="830" ind1=" " ind2="0"><subfield code="a">Progress in theoretical computer science</subfield><subfield code="v">11</subfield><subfield code="w">(DE-604)BV021856086</subfield><subfield code="9">11</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-017470474</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.BV023828300 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T21:37:34Z |
| institution | BVB |
| isbn | 3764337192 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-017470474 |
| oclc_num | 246881871 |
| open_access_boolean | |
| owner | DE-634 DE-83 DE-188 |
| owner_facet | DE-634 DE-83 DE-188 |
| physical | XII, 226 S. graph. Darst. |
| publishDate | 1994 |
| publishDateSearch | 1994 |
| publishDateSort | 1994 |
| publisher | Birkhäuser |
| record_format | marc |
| series | Progress in theoretical computer science |
| series2 | Progress in theoretical computer science |
| spelling | Straubing, Howard Verfasser aut Finite automata, formal logic, and circuit complexity Howard Straubing Boston ; Berlin [u.a.] Birkhäuser 1994 XII, 226 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Progress in theoretical computer science 11 Mathematische Logik (DE-588)4037951-6 gnd rswk-swf Endlicher Automat (DE-588)4224518-7 gnd rswk-swf Berechnungskomplexität (DE-588)4134751-1 gnd rswk-swf Automatentheorie (DE-588)4003953-5 gnd rswk-swf Komplexitätstheorie (DE-588)4120591-1 gnd rswk-swf Logik (DE-588)4036202-4 gnd rswk-swf Halbgruppentheorie (DE-588)4288418-4 gnd rswk-swf Endlicher Automat (DE-588)4224518-7 s Mathematische Logik (DE-588)4037951-6 s Halbgruppentheorie (DE-588)4288418-4 s Komplexitätstheorie (DE-588)4120591-1 s DE-604 Automatentheorie (DE-588)4003953-5 s Logik (DE-588)4036202-4 s Berechnungskomplexität (DE-588)4134751-1 s 1\p DE-604 Progress in theoretical computer science 11 (DE-604)BV021856086 11 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Straubing, Howard Finite automata, formal logic, and circuit complexity Progress in theoretical computer science Mathematische Logik (DE-588)4037951-6 gnd Endlicher Automat (DE-588)4224518-7 gnd Berechnungskomplexität (DE-588)4134751-1 gnd Automatentheorie (DE-588)4003953-5 gnd Komplexitätstheorie (DE-588)4120591-1 gnd Logik (DE-588)4036202-4 gnd Halbgruppentheorie (DE-588)4288418-4 gnd |
| subject_GND | (DE-588)4037951-6 (DE-588)4224518-7 (DE-588)4134751-1 (DE-588)4003953-5 (DE-588)4120591-1 (DE-588)4036202-4 (DE-588)4288418-4 |
| title | Finite automata, formal logic, and circuit complexity |
| title_auth | Finite automata, formal logic, and circuit complexity |
| title_exact_search | Finite automata, formal logic, and circuit complexity |
| title_full | Finite automata, formal logic, and circuit complexity Howard Straubing |
| title_fullStr | Finite automata, formal logic, and circuit complexity Howard Straubing |
| title_full_unstemmed | Finite automata, formal logic, and circuit complexity Howard Straubing |
| title_short | Finite automata, formal logic, and circuit complexity |
| title_sort | finite automata formal logic and circuit complexity |
| topic | Mathematische Logik (DE-588)4037951-6 gnd Endlicher Automat (DE-588)4224518-7 gnd Berechnungskomplexität (DE-588)4134751-1 gnd Automatentheorie (DE-588)4003953-5 gnd Komplexitätstheorie (DE-588)4120591-1 gnd Logik (DE-588)4036202-4 gnd Halbgruppentheorie (DE-588)4288418-4 gnd |
| topic_facet | Mathematische Logik Endlicher Automat Berechnungskomplexität Automatentheorie Komplexitätstheorie Logik Halbgruppentheorie |
| volume_link | (DE-604)BV021856086 |
| work_keys_str_mv | AT straubinghoward finiteautomataformallogicandcircuitcomplexity |