Entry Rosier:1988:CDF 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{Rosier:1988:CDF,
author = "Louis E. Rosier and Hsu-Chun Yen",
title = "On the complexity of deciding fair termination of
probabilistic concurrent finite-state programs",
journal = j-THEOR-COMP-SCI,
volume = "58",
number = "1-3",
pages = "263--324",
month = jun,
year = "1988",
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 = "Univ of Texas at Austin",
affiliationaddress = "Austin, TX, USA",
classification = "721; 723; 921; C4220 (Automata theory); C4240
(Programming and algorithm theory)",
conference = "Thirteenth International Colloquium on Automata,
Languages and Programming",
conflocation = "Rennes, France; 15-19 July 1986",
conftitle = "Thirteenth International Colloquium on Automata,
Languages and Programming",
corpsource = "Dept. of Comput. Sci., Texas Univ., Austin, TX, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "alternating logspace hierarchy; Automata
Theory--Finite Automata; Complexity; complexity of
deciding; computational complexity; Computer
Metatheory--Programming Theory; Computer Programming;
EXPTIME-complete; Fair Termination; fair termination;
finite automata; Lower Bounds; Mathematical
Techniques--Graph Theory; Probabilistic Concurrent
Finite-State Programs; probabilistic concurrent
finite-state programs; programming theory;
PSPACE-complete; PTIME; Theory; Turing Machines; Upper
Bounds",
meetingaddress = "Rennes, Fr",
meetingdate = "Jul 1986",
meetingdate2 = "07/86",
pubcountry = "Netherlands",
sponsororg = "Eur. Assoc. Theor. Comput. Sci",
treatment = "T Theoretical or Mathematical",
}
Related entries
- alternating,
36(2)291,
41(2)305,
41(2)331,
47(2)149,
54(2)267,
54(2)331,
61(2)149,
63(2)203,
66(3)273,
67(1)75,
67(1)99,
68(1)19,
68(2)175
- bound,
36(1)59,
36(2)231,
38(1)69,
38(1)133,
40(2)319,
41(2)247,
41(2)331,
43(2)201,
44(3)247,
45(1)63,
46(2)107,
46(2)329,
47(2)111,
47(2)149,
47(3)323,
49(2)171,
49(2)217,
52(3)239,
52(3)251,
54(2)325,
56(2)211,
57(1)97,
57(1)113,
58(1)175,
60(3)285,
61(2)149,
61(2)299,
62(3)311,
63(2)203,
64(1)1,
64(1)15,
64(1)83,
64(1)125,
64(3)331,
66(1)1,
66(1)105,
66(2)137,
67(1)55,
67(1)115,
69(3)319
- complete, PSPACE-,
36(2)265
- concurrent,
36(1)27,
38(1)1,
38(2)193,
39(2)107,
40(2)149,
43(2)213,
43(2)277,
45(1)1,
46(2)285,
49(2)185,
50(3)241,
51(3)281,
55(1)1,
55(1)87,
56(1)37,
58(0)3,
58(1)3,
58(1)183,
58(1)347,
58(1)379,
59(1)25,
60(1)1,
61(1)93,
61(2)121,
64(3)221,
64(3)281,
65(1)35,
66(0)117,
66(2)117,
66(3)333,
69(1)69
- deciding,
38(2)343,
67(1)19
- fair,
37(3)305,
45(2)193,
49(2)121,
51(1)129,
59(3)235,
64(3)221,
64(3)281,
64(3)305,
66(3)333
- Finite, Theory-,
64(3)271,
65(2)123
- finite-state,
52(1)91,
67(1)5,
68(1)19
- Graph, Techniques-,
58(0)3,
58(1)201,
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,
67(1)5
- hierarchy,
40(2)175,
43(1)107,
43(2)169,
47(1)39,
47(2)131,
48(1)109,
48(2)153,
49(1)1,
49(2)217,
51(1)53,
53(2)201,
54(1)87,
56(3)289,
58(1)175,
61(2)175,
62(1)39,
65(3)271,
67(1)99,
68(1)113
- lower,
36(1)59,
36(2)231,
38(1)69,
38(1)133,
40(2)319,
41(2)247,
43(2)201,
44(3)247,
46(2)329,
47(2)149,
47(3)323,
49(2)171,
52(3)239,
52(3)251,
54(2)325,
57(1)97,
57(1)113,
61(2)299,
62(3)311,
63(2)203,
64(1)1,
64(1)15,
64(1)83,
64(1)125,
64(3)331,
66(2)137,
67(1)115
- 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)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)5,
67(1)37,
67(1)55,
67(1)111,
67(1)115
- Metatheory--Programming,
59(1)3,
59(1)133,
59(1)157,
61(2)225,
61(2)259,
67(1)129
- probabilistic,
38(1)69,
40(1)57,
41(2)325,
49(2)267,
52(3)269,
53(1)67,
53(1)z,
54(1)65,
57(0)3,
57(1)87,
58(1)129,
62(3)251,
66(3)333
- Programming, Metatheory-,
59(1)3,
59(1)133,
59(1)157,
61(2)225,
61(2)259,
67(1)129
- PSPACE-complete,
36(2)265
- PTIME,
64(3)305
- Rosier, Louis E.,
64(3)305
- state, finite-,
52(1)91,
67(1)5,
68(1)19
- Techniques--Graph,
58(0)3,
58(1)201,
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,
67(1)5
- termination,
43(2)123,
46(2)305,
50(3)285,
56(3)345,
61(2)225,
62(1)187,
66(3)333
- Theory--Finite,
64(3)271,
65(2)123
- 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,
61(2)149,
66(3)289,
67(1)5,
67(1)99,
68(1)19,
68(2)123
- upper,
41(2)247,
46(2)107,
47(2)149,
49(2)217,
56(2)211,
60(3)285,
61(2)149,
66(1)1,
67(1)55
- Yen, Hsu-Chun,
46(2)107