Entry Muller:1995:SAT from tcs1995.bib
Last update: Sun Oct 15 02:56:11 MDT 2017
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{Muller:1995:SAT,
author = "David E. Muller and Paul E. Schupp",
title = "Simulating alternating tree automata by
nondeterministic automata: {New} results and new proofs
of the theorems of {Rabin}, {McNaughton} and {Safra}",
journal = j-THEOR-COMP-SCI,
volume = "141",
number = "1--2",
pages = "69--107",
day = "17",
month = apr,
year = "1995",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:18:59 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=141&issue=1-2;
http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1995&volume=141&issue=1-2&aid=1848",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4220 (Automata
theory); C4240C (Computational complexity)",
corpsource = "Dept. of Math., Illinois Univ., Urbana, IL, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "alternating tree automata; automata theory; complexity
results; computational complexity; nondeterministic
automata; simulation; theorem proving; trees
(mathematics); uniformizing strategies",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- alternating,
143(1)23,
143(1)123,
148(1)33,
177(2)425,
180(1)139,
180(1)229,
191(1)97,
198(1)99
- new,
141(1)283,
154(1)3,
156(1)263,
156(1)315,
185(2)217,
186(1)1,
221(1)3,
223(1)1,
223(1)179
- nondeterministic,
139(1)27,
141(1)175,
143(1)23,
143(1)123,
143(1)159,
148(2)207,
155(2)291,
159(2)271,
160(1)1,
161(1)301,
166(1)173,
174(1)269,
178(1)1,
178(1)37,
179(1)217,
189(1)1,
192(2)259,
194(1)137,
194(1)183,
195(1)3,
198(1)99,
200(1)1,
228(1)105
- proof,
135(1)67,
138(1)113,
138(2)243,
139(1)355,
140(1)95,
150(1)161,
151(1)3,
151(2)487,
152(2)219,
153(1)49,
155(2)439,
165(1)3,
165(1)75,
165(1)171,
166(1)1,
166(1)173,
166(1)291,
167(1)171,
169(1)3,
170(1)1,
170(1)129,
170(1)407,
173(2)311,
173(2)393,
175(1)29,
175(1)159,
176(1)159,
176(1)283,
177(2)487,
178(1)257,
179(1)103,
179(1)137,
179(1)333,
180(1)309,
180(1)371,
181(2)317,
183(2)253,
184(1)1,
185(2)319,
188(1)211,
189(1)71,
190(1)41,
191(1)37,
191(1)215,
193(1)53,
194(1)244-3,
194(1)247-2,
194(1)z,
197(1)242-3,
197(1)245-1,
197(1)245-2,
197(1)246-1,
197(1)246-2,
197(1)247-2,
198(1)201,
206(1)257,
206(1)331,
206(1)353,
212(1)141,
215(1)329,
216(1)271,
216(1)395,
227(1)299,
227(1)333
- proving,
138(1)101,
138(1)169,
138(2)243,
139(1)355,
142(2)209,
142(2)229,
142(2)257,
142(2)299,
145(1)111,
146(1)185,
146(1)199,
151(1)3,
151(2)487,
153(1)49,
154(1)3,
155(2)291,
155(2)439,
165(1)3,
165(1)57,
166(1)173,
166(1)291,
167(1)193,
169(1)3,
170(1)129,
170(1)245,
170(1)407,
172(1)1,
173(1)235,
173(1)283,
173(2)311,
173(2)393,
176(1)159,
177(1)183,
179(1)103,
180(1)371,
181(2)317,
183(2)187,
183(2)253,
189(1)71,
192(1)55,
194(1)244-3,
194(1)247-2,
197(1)245,
197(1)245-1,
197(1)246-1,
197(1)247-2,
198(1)201,
206(1)163,
206(1)341,
208(1)149
- Rabin,
148(1)121,
161(1)191,
189(1)1
- result,
137(2)253,
147(1)117,
148(2)281,
151(2)487,
157(1)101,
160(1)321,
163(1)99,
164(1)29,
168(2)267,
169(2)161,
176(1)111,
177(1)27,
177(1)155,
179(1)397,
188(1)129,
207(1)43,
215(1)383,
225(1)113
- Schupp, Paul E.,
204(1)233
- simulating,
197(1)245,
205(1)231,
209(1)319
- simulation,
134(1)51,
138(1)67,
143(1)123,
143(1)159,
148(1)157,
152(2)171,
153(1)3,
153(1)65,
154(1)23,
161(1)235,
162(2)245,
165(2)463,
168(2)303,
168(2)417,
169(1)23,
169(1)39,
173(1)3,
174(1)123,
194(1)242-1,
196(1)109,
196(1)215,
197(1)157,
197(1)245,
197(1)246,
198(1)201,
217(1)131,
225(1)81
- strategy,
139(1)315,
140(2)319,
146(1)145,
149(1)179,
154(2)165,
155(1)85,
157(2)161,
164(1)59,
165(1)75,
174(1)97,
182(1)217,
190(1)61,
190(2)211,
191(1)193,
197(1)203,
212(1)183