Modular construction of strategies winning infinite games:
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Abschlussarbeit Buch |
Sprache: | German |
Veröffentlicht: |
Kiel
Inst. für Informatik und Praktische Mathematik
1997
|
Schriftenreihe: | Bericht / Institut für Informatik und Praktische Mathematik
9709 |
Schlagworte: | |
Online-Zugang: | Inhaltsverzeichnis |
Beschreibung: | 149 S. graph. Darst. |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV011409201 | ||
003 | DE-604 | ||
005 | 20140804 | ||
007 | t | ||
008 | 970624s1997 gw d||| m||| 00||| ger d | ||
016 | 7 | |a 950539813 |2 DE-101 | |
035 | |a (OCoLC)75742560 | ||
035 | |a (DE-599)BVBBV011409201 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a ger | |
044 | |a gw |c DE | ||
049 | |a DE-91 |a DE-355 |a DE-12 |a DE-706 |a DE-11 |a DE-188 | ||
084 | |a SK 860 |0 (DE-625)143264: |2 rvk | ||
084 | |a DAT 310d |2 stub | ||
084 | |a MAT 924d |2 stub | ||
100 | 1 | |a Lescow, Helmut |e Verfasser |4 aut | |
245 | 1 | 0 | |a Modular construction of strategies winning infinite games |c Helmut Lescow |
264 | 1 | |a Kiel |b Inst. für Informatik und Praktische Mathematik |c 1997 | |
300 | |a 149 S. |b graph. Darst. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 1 | |a Bericht / Institut für Informatik und Praktische Mathematik |v 9709 | |
502 | |a Zugl.: Kiel, Univ., Diss., 1997 | ||
650 | 0 | 7 | |a Softwareentwicklung |0 (DE-588)4116522-6 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Unendliches Spiel |0 (DE-588)4528827-6 |2 gnd |9 rswk-swf |
655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
689 | 0 | 0 | |a Unendliches Spiel |0 (DE-588)4528827-6 |D s |
689 | 0 | 1 | |a Softwareentwicklung |0 (DE-588)4116522-6 |D s |
689 | 0 | |5 DE-604 | |
810 | 2 | |a Institut für Informatik und Praktische Mathematik |t Bericht |v 9709 |w (DE-604)BV000011623 |9 9709 | |
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=007670635&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
Datensatz im Suchindex
_version_ | 1805067844500586496 |
---|---|
adam_text |
CONTENTS
1
INTRODUCTION
3
2
BASICS
ON
INFINITE
GAMES
AND
^-AUTOMATA
11
2.1
GALE-STEWART
GAMES
.
11
2.2
GALE-STEWART
GAMES
AS
GAMES
ON
GRAPHS
.
13
3
DEFINITIONS
AND
PRELIMINARIES
18
3.1
INFINITE
GAMES
ON
FINITE
GRAPHS
.
18
3.2
STRATEGIES
IN
INFINITE
GAMES
.
20
3.3
I/O-AUTOMATA
FOR
REALIZING
STRATEGIES
.
25
4
CONSTRUCTION
OF
STRATEGIES
28
4.1
COMPOSING
STRATEGIES
.
28
4.2
PROPERTIES
OF
THE
STRATEGY
OPERATORS
.
37
4.2.1
DOMAINS,
FINAL
AND
ESCAPE
POSITIONS
OF
COMPOSED
STRATEGIES
.
.
37
4.2.2
COMPOSITIONAL
PROPERTIES
OF
THE
STRATEGY
OPERATORS
.
39
4.3
BASIC
STRATEGIES
.
41
4.3.1
THE
JOICE
AND
THE
STRATEGY
.
41
4.3.2
THE
2UJOTCE
STRATEGY
.
46
5
UPPER
MEMORY
BOUNDS
FOR
STRATEGIES
IN
MULLER
GAMES
56
5.1
PROPERTIES
OF
FFORCE
AND
SUJJORCE-STRATEGIES
IN
MULLER
GAMES
.
57
2
CONTENTS
5.2
GAINES
WITH
LONGEST
CHAIN
OF
LENGTH
K
.
63
5.2.1
COMPLEXITY
OF
THE
COMPUTATION
OF
WINNING
STRATEGIES
.
73
5.3
GS
GAMES
WITH
K
MINIMAL
POSITIVE
LOOPS
.
74
6
LOWER
MEMORY
BOUNDS
FOR
STRATEGIES
IN
MULLER
GAMES
85
6.1
GAMES
WITH
LONGEST
CHAIN
OF
LENGTH
K
.
86
6.2
GS
GAMES
WITH
K
MINIMAL
POSITIVE
LOOPS
.
96
6.3
EXPONENTIAL
LOWER
BOUNDS
.
103
7
REDUCING
THE
MEMORY
OF
WINNING
STRATEGIES
106
7.1
MINIMIZING
STRATEGIES
BY
PRE-PROCESSING
IN
MULLER
GAMES
.
108
7.1.1
COMPUTING
SEPARATING
SETS
.
113
7.2
MINIMIZING
STRATEGIES
BY
PRE-PROCESSING
IN
GS
GAMES
.
119
7.2.1
IMPROVEMENTS
FOR
TWO
NON-DISJOINT
MINIMAL
POSITIVE
LOOPS
.
.
.
120
7.2.2
IMPROVEMENTS
FOR
ARBITRARY
MANY
NON-DISJOINT
MINIMAL
POSITIVE
LOOPS
.
121
7.2.3
COMPUTING
THE
SIZE
OF
IMPROVED
GS
STRATEGIES
.
127
7.3
MINIMIZING
EXISTING
STRATEGIES
.
129
8
GAMES
WITH
RABIN
AND
STREETT
WINNING
CONDITION
133
8.1
UPPER
MEMORY
BOUNDS
.
134
8.2
LOWER
MEMORY
BOUNDS
.
140
9
CONCLUSION
143 |
any_adam_object | 1 |
author | Lescow, Helmut |
author_facet | Lescow, Helmut |
author_role | aut |
author_sort | Lescow, Helmut |
author_variant | h l hl |
building | Verbundindex |
bvnumber | BV011409201 |
classification_rvk | SK 860 |
classification_tum | DAT 310d MAT 924d |
ctrlnum | (OCoLC)75742560 (DE-599)BVBBV011409201 |
discipline | Informatik Mathematik |
format | Thesis Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 cb4500</leader><controlfield tag="001">BV011409201</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20140804</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">970624s1997 gw d||| m||| 00||| ger d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">950539813</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)75742560</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV011409201</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">ger</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">DE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91</subfield><subfield code="a">DE-355</subfield><subfield code="a">DE-12</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-188</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 860</subfield><subfield code="0">(DE-625)143264:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 310d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 924d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Lescow, Helmut</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Modular construction of strategies winning infinite games</subfield><subfield code="c">Helmut Lescow</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Kiel</subfield><subfield code="b">Inst. für Informatik und Praktische Mathematik</subfield><subfield code="c">1997</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">149 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">Bericht / Institut für Informatik und Praktische Mathematik</subfield><subfield code="v">9709</subfield></datafield><datafield tag="502" ind1=" " ind2=" "><subfield code="a">Zugl.: Kiel, Univ., Diss., 1997</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Softwareentwicklung</subfield><subfield code="0">(DE-588)4116522-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Unendliches Spiel</subfield><subfield code="0">(DE-588)4528827-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4113937-9</subfield><subfield code="a">Hochschulschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Unendliches Spiel</subfield><subfield code="0">(DE-588)4528827-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Softwareentwicklung</subfield><subfield code="0">(DE-588)4116522-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Institut für Informatik und Praktische Mathematik</subfield><subfield code="t">Bericht</subfield><subfield code="v">9709</subfield><subfield code="w">(DE-604)BV000011623</subfield><subfield code="9">9709</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=007670635&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield></record></collection> |
genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
genre_facet | Hochschulschrift |
id | DE-604.BV011409201 |
illustrated | Illustrated |
indexdate | 2024-07-20T03:40:41Z |
institution | BVB |
language | German |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007670635 |
oclc_num | 75742560 |
open_access_boolean | |
owner | DE-91 DE-BY-TUM DE-355 DE-BY-UBR DE-12 DE-706 DE-11 DE-188 |
owner_facet | DE-91 DE-BY-TUM DE-355 DE-BY-UBR DE-12 DE-706 DE-11 DE-188 |
physical | 149 S. graph. Darst. |
publishDate | 1997 |
publishDateSearch | 1997 |
publishDateSort | 1997 |
publisher | Inst. für Informatik und Praktische Mathematik |
record_format | marc |
series2 | Bericht / Institut für Informatik und Praktische Mathematik |
spelling | Lescow, Helmut Verfasser aut Modular construction of strategies winning infinite games Helmut Lescow Kiel Inst. für Informatik und Praktische Mathematik 1997 149 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Bericht / Institut für Informatik und Praktische Mathematik 9709 Zugl.: Kiel, Univ., Diss., 1997 Softwareentwicklung (DE-588)4116522-6 gnd rswk-swf Unendliches Spiel (DE-588)4528827-6 gnd rswk-swf (DE-588)4113937-9 Hochschulschrift gnd-content Unendliches Spiel (DE-588)4528827-6 s Softwareentwicklung (DE-588)4116522-6 s DE-604 Institut für Informatik und Praktische Mathematik Bericht 9709 (DE-604)BV000011623 9709 DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=007670635&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
spellingShingle | Lescow, Helmut Modular construction of strategies winning infinite games Softwareentwicklung (DE-588)4116522-6 gnd Unendliches Spiel (DE-588)4528827-6 gnd |
subject_GND | (DE-588)4116522-6 (DE-588)4528827-6 (DE-588)4113937-9 |
title | Modular construction of strategies winning infinite games |
title_auth | Modular construction of strategies winning infinite games |
title_exact_search | Modular construction of strategies winning infinite games |
title_full | Modular construction of strategies winning infinite games Helmut Lescow |
title_fullStr | Modular construction of strategies winning infinite games Helmut Lescow |
title_full_unstemmed | Modular construction of strategies winning infinite games Helmut Lescow |
title_short | Modular construction of strategies winning infinite games |
title_sort | modular construction of strategies winning infinite games |
topic | Softwareentwicklung (DE-588)4116522-6 gnd Unendliches Spiel (DE-588)4528827-6 gnd |
topic_facet | Softwareentwicklung Unendliches Spiel Hochschulschrift |
url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=007670635&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
volume_link | (DE-604)BV000011623 |
work_keys_str_mv | AT lescowhelmut modularconstructionofstrategieswinninginfinitegames |