Entry Muller:1992:AAW from tcs1990.bib
Last update: Wed Sep 26 02:11:46 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{Muller:1992:AAW,
author = "D. E. Muller and A. Saoudi and P. E. Schupp",
title = "Alternating automata, the weak monadic theory of trees
and its complexity",
journal = j-THEOR-COMP-SCI,
volume = "97",
number = "2",
pages = "233--244",
day = "27",
month = apr,
year = "1992",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:24:22 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4220 (Automata theory); C4240
(Programming and algorithm theory)",
corpsource = "Illinois Univ., Urbana, IL, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "alternating automaton; automata theory; Buchi
acceptance; complexity; computational complexity;
formal languages; formal logic; language; prenex normal
form; quantifiers; time bound; trees; trees
(mathematics); weak acceptance condition; weak monadic
logic; weak monadic sentences",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- acceptance,
93(2)227,
126(2)183
- alternating,
76(2)323,
81(1)77,
83(2)323,
88(2)287,
88(2)297,
96(2)411,
97(2)183,
99(2)243,
99(2)301,
104(2)185,
106(2)351,
108(2)393,
113(1)55,
125(2)243,
127(1)171,
128(1)127,
132(1)319,
134(2)427
- automaton,
76(2)223,
78(2)363,
79(1)151,
84(2)281,
88(1)117,
88(2)231,
91(1)57,
92(1)119,
92(1)181,
92(2)249,
93(2)227,
95(1)159,
96(2)305,
97(2)245,
98(2)347,
106(1)61,
108(1)83,
115(2)391,
116(2)305,
116(2)373,
119(2)233,
120(2)197,
123(2)199,
125(2)243,
125(2)315,
131(2)295,
134(1)253,
134(2)387,
136(2)291
- bound,
72(2)251,
73(3)313,
74(2)121,
74(3)313,
74(3)329,
81(2)237,
82(1)19,
82(1)113,
82(1)157,
83(2)169,
85(1)155,
85(2)305,
86(2)267,
88(1)59,
91(2)265,
92(1)191,
93(2)279,
96(2)411,
97(2)285,
98(2)289,
100(1)185,
100(1)223,
102(2)215,
102(2)253,
102(2)355,
106(2)221,
106(2)351,
107(1)77,
107(1)121,
108(2)251,
108(2)271,
108(2)311,
110(1)1,
112(2)355,
112(2)419,
113(1)75,
116(1)195,
116(2)305,
116(2)415,
119(2)267,
120(2)169,
121(1)279,
123(1)95,
123(1)145,
123(2)377,
123(2)389,
125(2)329,
125(2)373,
127(2)395,
128(1)63,
129(1)193,
129(2)263,
129(2)279,
130(1)17,
130(1)49,
130(1)73,
130(1)85,
130(1)163,
130(1)175,
131(2)243,
131(2)331,
132(1)259,
132(1)377,
132(1)387,
133(1)23,
133(1)105,
134(1)189,
134(1)253,
136(2)527
- Buchi,
93(2)227,
96(2)345,
126(1)77,
126(2)183
- condition,
70(1)35,
70(1)151,
70(2)179,
72(1)27,
74(1)3,
75(1)111,
83(1)57,
83(2)189,
86(1)81,
86(2)233,
87(2)315,
88(2)269,
93(2)185,
93(2)227,
93(2)279,
94(1)101,
94(1)141,
94(2)335,
95(2)307,
97(1)143,
100(1)157,
100(2)267,
100(2)325,
103(1)39,
105(1)7,
109(1)181,
110(1)1,
111(1)89,
112(1)145,
112(2)413,
113(1)93,
118(2)301,
120(1)69,
120(2)197,
121(1)309,
126(2)183,
129(1)123,
131(2)271,
132(1)259
- form,
73(2)231,
79(1)227,
81(2)305,
82(1)95,
83(2)219,
87(2)287,
92(1)87,
92(1)z,
93(1)91,
94(2)199,
95(2)339,
97(1)105,
98(1)115,
102(2)307,
104(1)3,
107(2)253,
112(2)277,
116(1)59,
119(1)145,
120(2)197,
121(1)71,
123(2)199,
133(2)387
- monadic,
80(2)153,
83(2)323,
84(2)165,
88(1)139,
93(2)227,
101(1)3,
103(1)143,
109(1)49,
113(1)119,
116(1)151,
126(1)53,
126(1)97,
134(1)175
- normal,
79(1)227,
87(2)287,
94(2)199,
95(2)339,
97(1)105,
104(1)3,
105(1)27,
107(2)277,
120(2)197,
121(1)71,
129(1)167,
131(2)375
- quantifier,
81(2)223,
83(1)29,
102(1)207,
103(2)387,
107(1)145,
126(1)97
- Saoudi, A.,
84(2)165,
136(2)387
- sentences,
97(2)263
- weak,
70(1)127,
79(2)295,
82(2)409,
83(2)323,
87(1)203,
87(1)221,
93(2)185,
93(2)227,
94(1)101,
103(1)143,
112(2)413,
118(2)193,
120(2)197,
133(1)3,
133(1)85