Entry Swart:1989:IS from tcs1985.bib
Last update: Thu Sep 27 02:46:57 MDT 2018
Top |
Symbols |
Numbers |
Math |
A |
B |
C |
D |
E |
F |
G |
H |
I |
J |
K |
L |
M |
N |
O |
P |
Q |
R |
S |
T |
U |
V |
W |
X |
Y |
Z
BibTeX entry
@Article{Swart:1989:IS,
author = "Charles Swart and Dana Richards",
title = "On the inference of strategies",
journal = j-THEOR-COMP-SCI,
volume = "67",
number = "1",
pages = "5--18",
day = "5",
month = sep,
year = "1989",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
affiliation = "Oregon State Univ",
affiliationaddress = "Corvallis, OR, USA",
classification = "721; 921; 922; C1140E (Game theory); C4220 (Automata
theory)",
corpsource = "Dept. of Comput. Sci., Oregon State Univ., Corvallis,
OR, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Automata Theory; automata theory; counter machine;
Counter Machine Strategies; decidability; finite-state
strategies; game theory; Game Theory; graph traversal
techniques; Graph Traversal Techniques; inference
mechanisms; Inference of Strategies; inference of
strategies; infinite tournaments; Mathematical
Techniques--Graph Theory; optimal defense; Prisoner's
Dilemma; Probability; Turing machine; Turing Machine
Strategies; Turing machines; two-person games",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- C1140E,
38(1)69,
47(2)205,
56(3)289
- counter,
39(2)89,
51(3)325,
61(1)17
- decidability,
35(1)1,
35(2)191,
35(2)227,
35(2)329,
35(2)337,
36(2)173,
37(2)123,
38(1)117,
39(2)281,
41(1)51,
41(1)105,
41(2)247,
44(2)199,
44(2)237,
46(1)83,
47(1)27,
47(1)39,
47(1)71,
47(2)225,
47(3)247,
48(2)257,
48(2)329,
49(1)43,
51(3)255,
52(3)177,
53(2)243,
55(1)1,
55(2)141,
58(1)231,
59(3)287,
61(2)259,
61(2)289,
64(3)305,
64(3)343,
65(2)265,
66(1)55,
67(1)19,
67(1)129,
67(2)143,
67(2)303,
68(3)267,
68(3)319,
68(3)343
- finite-state,
52(1)91,
58(1)263,
68(1)19
- game,
38(1)69,
47(2)205,
56(3)289,
68(1)113
- Graph, Techniques-,
58(0)3,
58(1)201,
58(1)263,
58(1)325,
61(2)121,
61(2)175,
63(2)223,
63(3)253,
63(3)295,
64(1)83,
64(1)125,
64(2)159
- inference,
35(2)129,
38(1)99,
41(2)271,
54(1)103,
62(1)39,
62(3)289,
66(3)255,
67(2)173
- infinite,
35(2)227,
36(1)1,
37(1)51,
38(1)137,
39(2)281,
43(1)59,
43(1)99,
43(2)277,
43(2)315,
44(1)107,
44(2)175,
46(2)141,
47(1)15,
48(1)9,
49(2)87,
49(2)113,
49(2)z,
52(1)165,
54(2)139,
54(2)267,
54(2)277,
58(1)231,
59(1)115,
61(1)1,
61(1)25,
61(2)259,
65(2)143,
65(2)221,
65(2)z,
67(2)303
- mathematical,
36(2)145,
45(1)1,
57(0)3,
57(1)131,
57(1)147,
57(1)153,
58(0)3,
58(1)17,
58(1)103,
58(1)143,
58(1)183,
58(1)201,
58(1)209,
58(1)263,
58(1)325,
58(1)361,
58(1)379,
59(3)277,
59(3)297,
60(1)1,
60(3)297,
61(2)121,
61(2)175,
61(2)225,
61(2)289,
61(2)299,
61(2)307,
62(1)221,
62(3)235,
62(3)251,
63(1)43,
63(1)63,
63(2)223,
63(3)239,
63(3)253,
63(3)275,
63(3)295,
64(1)1,
64(1)15,
64(1)83,
64(1)107,
64(1)125,
64(2)135,
64(2)159,
65(0)123,
65(2)123,
65(2)131,
65(2)143,
65(2)149,
65(2)153,
65(2)189,
65(2)197,
65(2)213,
65(2)221,
65(2)243,
65(2)249,
65(2)265,
66(0)117,
66(2)137,
66(2)157,
66(2)181,
66(2)205,
67(1)37,
67(1)55,
67(1)111,
67(1)115
- mechanism,
45(1)87,
50(2)137,
59(1)25,
66(3)255,
67(2)173
- optimal,
39(1)15,
39(1)z,
45(1)63,
53(2)281,
53(2)295,
59(3)259,
59(3)297,
61(1)33,
63(2)203,
64(1)83,
64(1)125,
64(2)159,
66(1)105,
66(2)137,
66(2)157
- probability,
41(2)325,
49(2)267,
53(1)67,
53(1)99,
57(1)87,
62(3)251,
63(2)185,
64(2)203,
65(0)123,
65(2)149,
65(2)171,
65(2)z,
68(1)1
- state, finite-,
52(1)91,
58(1)263,
68(1)19
- strategy,
53(1)151,
59(1)133,
65(1)1,
65(3)271
- technique,
39(2)319,
40(1)67,
40(2)101,
45(1)87,
46(2)261,
48(1)75,
49(1)81,
49(2)171,
50(2)137,
50(3)323,
51(1)53,
52(3)193,
53(2)169,
53(2)281,
54(1)53,
54(1)87,
54(1)129,
54(2)315,
57(0)3,
57(1)97,
57(1)131,
57(1)147,
57(1)153,
58(1)103,
58(1)209,
59(1)157,
59(3)297,
61(2)299,
63(3)275,
63(3)295,
64(1)107,
64(2)135,
64(2)175,
65(1)1,
65(2)123,
65(2)131,
65(2)149,
65(2)153,
65(2)189,
65(2)197,
65(2)213,
65(2)243,
65(2)249,
66(0)117,
66(1)45,
66(2)137,
67(1)37,
67(1)87,
68(3)267,
69(1)1
- Techniques--Graph,
58(0)3,
58(1)201,
58(1)263,
58(1)325,
61(2)121,
61(2)175,
63(2)223,
63(3)253,
63(3)295,
64(1)83,
64(1)125,
64(2)159
- tournament,
43(1)43,
61(2)307
- traversal,
38(1)83
- Turing,
35(2)191,
35(2)215,
36(2)341,
37(1)1,
40(2)175,
41(2)331,
43(1)43,
43(1)107,
44(1)1,
44(1)111,
47(2)131,
47(3)237,
51(3)265,
52(1)15,
52(3)251,
52(3)341,
53(2)307,
54(2)325,
54(2)331,
55(2)291,
57(1)47,
58(1)175,
58(1)263,
61(2)149,
66(3)289,
67(1)99,
68(1)19,
68(2)123