Finite automata, formal logic, and circuit complexity:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Boston [u.a.]
Birkhäuser
1994
|
| Schriftenreihe: | Progress in theoretical computer science
|
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | Literaturverz. S. 217 - 222 |
| Beschreibung: | XII, 226 S. |
| ISBN: | 0817637192 3764337192 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV009657020 | ||
| 003 | DE-604 | ||
| 005 | 20030707 | ||
| 007 | t | ||
| 008 | 940615s1994 |||| 00||| eng d | ||
| 016 | 7 | |a 941483657 |2 DE-101 | |
| 020 | |a 0817637192 |9 0-8176-3719-2 | ||
| 020 | |a 3764337192 |9 3-7643-3719-2 | ||
| 035 | |a (OCoLC)29024667 | ||
| 035 | |a (DE-599)BVBBV009657020 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T |a DE-384 |a DE-20 |a DE-739 |a DE-19 |a DE-11 | ||
| 050 | 0 | |a QA76.9.M35 | |
| 082 | 0 | |a 511.3 |2 20 | |
| 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 [u.a.] |b Birkhäuser |c 1994 | |
| 300 | |a XII, 226 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 0 | |a Progress in theoretical computer science | |
| 500 | |a Literaturverz. S. 217 - 222 | ||
| 650 | 7 | |a Complexité de calcul (Informatique) |2 ram | |
| 650 | 7 | |a Informatique - Mathématiques |2 ram | |
| 650 | 7 | |a Logique symbolique et mathématique |2 ram | |
| 650 | 7 | |a automate fini |2 inriac | |
| 650 | 7 | |a complexité circuit |2 inriac | |
| 650 | 7 | |a demi-groupe fini |2 inriac | |
| 650 | 7 | |a langage formel |2 inriac | |
| 650 | 7 | |a logique 1er ordre |2 inriac | |
| 650 | 7 | |a logique formelle |2 inriac | |
| 650 | 7 | |a quantificateur |2 inriac | |
| 650 | 7 | |a théorie jeu |2 inriac | |
| 650 | 7 | |a théorème Krohn-Rhodes |2 inriac | |
| 650 | 4 | |a Informatik | |
| 650 | 4 | |a Mathematik | |
| 650 | 4 | |a Computational complexity | |
| 650 | 4 | |a Computer science |x Mathematics | |
| 650 | 4 | |a Logic, Symbolic and mathematical | |
| 650 | 4 | |a Machine theory | |
| 650 | 4 | |a Robots | |
| 650 | 0 | 7 | |a Automatentheorie |0 (DE-588)4003953-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Mathematische Logik |0 (DE-588)4037951-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Halbgruppentheorie |0 (DE-588)4288418-4 |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 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 Berechnungskomplexität |0 (DE-588)4134751-1 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Automatentheorie |0 (DE-588)4003953-5 |D s |
| 689 | 0 | 1 | |a Logik |0 (DE-588)4036202-4 |D s |
| 689 | 0 | 2 | |a Halbgruppentheorie |0 (DE-588)4288418-4 |D s |
| 689 | 0 | 3 | |a Berechnungskomplexität |0 (DE-588)4134751-1 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Endlicher Automat |0 (DE-588)4224518-7 |D s |
| 689 | 1 | 1 | |a Mathematische Logik |0 (DE-588)4037951-6 |D s |
| 689 | 1 | 2 | |a Halbgruppentheorie |0 (DE-588)4288418-4 |D s |
| 689 | 1 | 3 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |D s |
| 689 | 1 | |8 1\p |5 DE-604 | |
| 689 | 2 | 0 | |a Mathematische Logik |0 (DE-588)4037951-6 |D s |
| 689 | 2 | |5 DE-604 | |
| 689 | 3 | 0 | |a Halbgruppentheorie |0 (DE-588)4288418-4 |D s |
| 689 | 3 | |5 DE-604 | |
| 689 | 4 | 0 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |D s |
| 689 | 4 | |5 DE-604 | |
| 856 | 4 | 2 | |m DNB Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=006384716&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-006384716 | |
Datensatz im Suchindex
| _version_ | 1807506026673471488 |
|---|---|
| adam_text |
CONTENTS
PREFACE
VII
I
MATHEMATICAL
PRELIMINARIES
1
1.1
WORDS
AND
LANGUAGES
.
1
1.2
AUTOMATA
AND
REGULAR
LANGUAGES
.
2
1.3
SEMIGROUPS
AND
HOMOMORPHISMS
.
6
II
FORMAL
LANGUAGES
AND
FORMAL
LOGIC
9
II.
1
EXAMPLES
.
9
II.2
DEFINITIONS
.
11
III
FINITE
AUTOMATA
21
III.L
MONADIC
SECOND-ORDER
SENTENCES
AND
REGULAR
LANGUAGES
21
III.2
REGULAR
NUMERICAL
PREDICATES
.
25
III.3
INFINITE
WORDS
AND
DECIDABLE
THEORIES
.
28
IV
MODEL-THEORETIC
GAMES
39
IV.
1
THE
EHRENFEUCHT-FRAISSE
GAME
.
39
IV.
2
APPLICATION
TO
FO[ ]
.
44
IV.3
APPLICATION
TO
FO[+1]
.
46
V
FINITE
SEMIGROUPS
53
V.L
THE
SYNTACTIC
MONOID
.
53
V.2
CALCULATION
OF
THE
SYNTACTIC
MONOID
.
57
V.3
APPLICATION
TO
FO[ ]
.
59
V.4
SEMIDIRECT
PRODUCTS
.
61
V.5
CATEGORIES
AND
PATH
CONDITIONS
.
66
V.6
PSEUDOVARIETIES
.
71
VII
VIII
CONTENTS
VI
FIRST-ORDER
LOGIC
79
VI.
1
CHARACTERIZATION
OF
F(?[ ]
.
79
VI.2
A
HIERARCHY
IN
F(?[ ]
.
84
VI.3
ANOTHER
CHARACTERIZATION
OF
FO[+1]
.
89
VI.4
SENTENCES
WITH
REGULAR
NUMERICAL
PREDICATES
.
93
VII
MODULAR
QUANTIFIERS
99
VII.
1
DEFINITION
AND
EXAMPLES
.
99
VII.2
LANGUAGES
IN
(FO
+
AFOD(P))[ ]
.
102
VII.3
LANGUAGES
IN
(FO
+
M
OD)[+
1]
.
107
VII.4
LANGUAGES
IN
(FO
4
MOD)[REG]
.
117
VII.5
SUMMARY
.
121
VIII
CIRCUIT
COMPLEXITY
127
VIII.L
EXAMPLES
OF
CIRCUITS
.
127
VIII.2
CIRCUITS
AND
CIRCUIT
COMPLEXITY
CLASSES
.
135
VIII.3
LOWER
BOUNDS
.
143
IX
REGULAR
LANGUAGES
AND
CIRCUIT
COMPLEXITY
155
IX.
1
REGULAR
LANGUAGES
IN
NC*
.
155
IX.2
FORMULAS
WITH
ARBITRARY
NUMERICAL
PREDICATES
.
161
IX.3
REGULAR
LANGUAGES
AND
NONREGULAR
NUMERICAL
PREDICATES
166
IX.4
SPECIAL
CASES
OF
THE
CENTRAL
CONJECTURE
.
170
A
PROOF
OF
THE
KROHN-RHODES
THEOREM
179
A.L
IDEAL
STRUCTURE
OF
FINITE
SEMIGROUPS
.
179
A.2
TYANSFORMATION
SEMIGROUPS
AND
WREATH
PRODUCTS
.
182
A.3
DECOMPOSITION
OF
TYANSFORMATION
SEMIGROUPS
.
187
A.4
COMPLETION
OF
THE
PROOF
.
191
B
PROOFS
OF
THE
CATEGORY
THEOREMS
199
B.L
PROOF
OF
THEOREM
V.5.2
.
199
B.2
APERIODIC
AND
GROUP
CATEGORIES
.
203
B.3
PROOF
OF THEOREM
V.5.5
.
205
BIBLIOGRAPHY
217
INDEX
223 |
| any_adam_object | 1 |
| author | Straubing, Howard |
| author_facet | Straubing, Howard |
| author_role | aut |
| author_sort | Straubing, Howard |
| author_variant | h s hs |
| building | Verbundindex |
| bvnumber | BV009657020 |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76.9.M35 |
| callnumber-search | QA76.9.M35 |
| callnumber-sort | QA 276.9 M35 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | ST 130 |
| ctrlnum | (OCoLC)29024667 (DE-599)BVBBV009657020 |
| dewey-full | 511.3 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511.3 |
| dewey-search | 511.3 |
| dewey-sort | 3511.3 |
| dewey-tens | 510 - Mathematics |
| discipline | Informatik Mathematik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 c 4500</leader><controlfield tag="001">BV009657020</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20030707</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940615s1994 |||| 00||| eng d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">941483657</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0817637192</subfield><subfield code="9">0-8176-3719-2</subfield></datafield><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)29024667</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009657020</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-29T</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-11</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA76.9.M35</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.3</subfield><subfield code="2">20</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 [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></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">Progress in theoretical computer science</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Literaturverz. S. 217 - 222</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">Informatique - Mathématiques</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Logique symbolique et mathématique</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é circuit</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">demi-groupe fini</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">logique 1er ordre</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">logique formelle</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">quantificateur</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">théorie jeu</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">théorème Krohn-Rhodes</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Informatik</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematik</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer science</subfield><subfield code="x">Mathematics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Logic, Symbolic and mathematical</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Machine theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Robots</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">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">Halbgruppentheorie</subfield><subfield code="0">(DE-588)4288418-4</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">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">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="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="1"><subfield code="a">Logik</subfield><subfield code="0">(DE-588)4036202-4</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">Berechnungskomplexität</subfield><subfield code="0">(DE-588)4134751-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">Endlicher Automat</subfield><subfield code="0">(DE-588)4224518-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" 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="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">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="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Mathematische Logik</subfield><subfield code="0">(DE-588)4037951-6</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">Halbgruppentheorie</subfield><subfield code="0">(DE-588)4288418-4</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">Komplexitätstheorie</subfield><subfield code="0">(DE-588)4120591-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="4" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">DNB Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=006384716&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</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="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006384716</subfield></datafield></record></collection> |
| id | DE-604.BV009657020 |
| illustrated | Not Illustrated |
| indexdate | 2024-08-16T01:34:33Z |
| institution | BVB |
| isbn | 0817637192 3764337192 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006384716 |
| oclc_num | 29024667 |
| open_access_boolean | |
| owner | DE-29T DE-384 DE-20 DE-739 DE-19 DE-BY-UBM DE-11 |
| owner_facet | DE-29T DE-384 DE-20 DE-739 DE-19 DE-BY-UBM DE-11 |
| physical | XII, 226 S. |
| publishDate | 1994 |
| publishDateSearch | 1994 |
| publishDateSort | 1994 |
| publisher | Birkhäuser |
| record_format | marc |
| series2 | Progress in theoretical computer science |
| spelling | Straubing, Howard Verfasser aut Finite automata, formal logic, and circuit complexity Howard Straubing Boston [u.a.] Birkhäuser 1994 XII, 226 S. txt rdacontent n rdamedia nc rdacarrier Progress in theoretical computer science Literaturverz. S. 217 - 222 Complexité de calcul (Informatique) ram Informatique - Mathématiques ram Logique symbolique et mathématique ram automate fini inriac complexité circuit inriac demi-groupe fini inriac langage formel inriac logique 1er ordre inriac logique formelle inriac quantificateur inriac théorie jeu inriac théorème Krohn-Rhodes inriac Informatik Mathematik Computational complexity Computer science Mathematics Logic, Symbolic and mathematical Machine theory Robots Automatentheorie (DE-588)4003953-5 gnd rswk-swf Mathematische Logik (DE-588)4037951-6 gnd rswk-swf Halbgruppentheorie (DE-588)4288418-4 gnd rswk-swf Endlicher Automat (DE-588)4224518-7 gnd rswk-swf Komplexitätstheorie (DE-588)4120591-1 gnd rswk-swf Logik (DE-588)4036202-4 gnd rswk-swf Berechnungskomplexität (DE-588)4134751-1 gnd rswk-swf Automatentheorie (DE-588)4003953-5 s Logik (DE-588)4036202-4 s Halbgruppentheorie (DE-588)4288418-4 s Berechnungskomplexität (DE-588)4134751-1 s DE-604 Endlicher Automat (DE-588)4224518-7 s Mathematische Logik (DE-588)4037951-6 s Komplexitätstheorie (DE-588)4120591-1 s 1\p DE-604 DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=006384716&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Straubing, Howard Finite automata, formal logic, and circuit complexity Complexité de calcul (Informatique) ram Informatique - Mathématiques ram Logique symbolique et mathématique ram automate fini inriac complexité circuit inriac demi-groupe fini inriac langage formel inriac logique 1er ordre inriac logique formelle inriac quantificateur inriac théorie jeu inriac théorème Krohn-Rhodes inriac Informatik Mathematik Computational complexity Computer science Mathematics Logic, Symbolic and mathematical Machine theory Robots Automatentheorie (DE-588)4003953-5 gnd Mathematische Logik (DE-588)4037951-6 gnd Halbgruppentheorie (DE-588)4288418-4 gnd Endlicher Automat (DE-588)4224518-7 gnd Komplexitätstheorie (DE-588)4120591-1 gnd Logik (DE-588)4036202-4 gnd Berechnungskomplexität (DE-588)4134751-1 gnd |
| subject_GND | (DE-588)4003953-5 (DE-588)4037951-6 (DE-588)4288418-4 (DE-588)4224518-7 (DE-588)4120591-1 (DE-588)4036202-4 (DE-588)4134751-1 |
| 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 | Complexité de calcul (Informatique) ram Informatique - Mathématiques ram Logique symbolique et mathématique ram automate fini inriac complexité circuit inriac demi-groupe fini inriac langage formel inriac logique 1er ordre inriac logique formelle inriac quantificateur inriac théorie jeu inriac théorème Krohn-Rhodes inriac Informatik Mathematik Computational complexity Computer science Mathematics Logic, Symbolic and mathematical Machine theory Robots Automatentheorie (DE-588)4003953-5 gnd Mathematische Logik (DE-588)4037951-6 gnd Halbgruppentheorie (DE-588)4288418-4 gnd Endlicher Automat (DE-588)4224518-7 gnd Komplexitätstheorie (DE-588)4120591-1 gnd Logik (DE-588)4036202-4 gnd Berechnungskomplexität (DE-588)4134751-1 gnd |
| topic_facet | Complexité de calcul (Informatique) Informatique - Mathématiques Logique symbolique et mathématique automate fini complexité circuit demi-groupe fini langage formel logique 1er ordre logique formelle quantificateur théorie jeu théorème Krohn-Rhodes Informatik Mathematik Computational complexity Computer science Mathematics Logic, Symbolic and mathematical Machine theory Robots Automatentheorie Mathematische Logik Halbgruppentheorie Endlicher Automat Komplexitätstheorie Logik Berechnungskomplexität |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=006384716&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT straubinghoward finiteautomataformallogicandcircuitcomplexity |