Entry Globerman:1996:CRT 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{Globerman:1996:CRT,
author = "Noa Globerman and David Harel",
title = "Complexity results for two-way and multi-pebble
automata and their logics",
journal = j-THEOR-COMP-SCI,
volume = "169",
number = "2",
pages = "161--184",
day = "05",
month = dec,
year = "1996",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:20:29 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=169&issue=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=1996&volume=169&issue=2&aid=2322",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4220 (Automata theory);
C4240C (Computational complexity)",
conflocation = "Jerusalem, Israel; 11-14 July 1994",
conftitle = "21st International Colloquium on Automata, Languages,
and Programming",
corpsource = "Dept. of Math. and Comput. Sci., Bar-Ilan Univ.,
Ramat-Gan, Israel",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "complexity results; computational complexity;
concurrency; finite automata; formal logic; logics;
multi-pebble automata; nondeterminism; propositional
dynamic logic; reasoning problem; regular languages;
two-way automata",
pubcountry = "Netherlands",
sponsororg = "Eur. Assoc. Theor. Comput. Sci",
treatment = "P Practical; T Theoretical or Mathematical",
}
Related entries
- concurrency,
138(2)425,
149(1)151,
150(1)77,
151(1)195,
151(2)353,
153(1)211,
154(1)107,
155(1)39,
156(1)203,
165(1)201,
170(1)145,
170(1)297,
170(1)445,
174(1)67,
177(1)73,
177(2)329,
179(1)61,
179(1)333,
180(1)341,
185(2)259,
190(2)363,
194(1)242,
194(1)z,
195(2)183,
197(1)1
- dynamic,
138(1)211,
140(2)205,
140(2)319,
142(1)59,
144(1)125,
151(1)125,
158(1)233,
161(1)109,
162(2)341,
164(1)165,
165(2)407,
165(2)441,
166(1)173,
167(1)235,
168(2)461,
174(1)203,
175(2)225,
184(1)195,
186(1)199,
190(2)115,
192(2)201,
194(1)242-1,
195(1)3,
199(1)145,
216(1)109,
217(1)157,
229(1)41
- nondeterminism,
138(2)273,
143(1)23,
151(1)37,
155(1)39,
159(2)245,
159(2)271,
170(1)83,
177(1)3,
177(2)329,
178(1)37,
179(1)217,
181(1)141,
190(1)61,
202(1)1,
254(1)691
- propositional,
147(1)149,
155(1)157,
155(1)277,
159(2)343,
161(1)109,
163(1)99,
166(1)1,
166(1)221,
170(1)129,
171(1)179,
175(1)15,
177(2)381,
179(1)427,
182(1)183,
183(2)187,
186(1)135,
195(1)33,
197(1)245,
197(1)245-2,
198(1)201
- reasoning,
137(1)25,
138(1)201,
142(2)277,
149(2)231,
151(2)437,
152(2)219,
152(2)269,
155(1)157,
160(1)321,
160(1)365,
166(1)1,
166(1)221,
166(1)291,
167(1)47,
170(1)129,
170(1)209,
171(1)61,
171(1)111,
171(1)221,
171(1)247,
173(2)311,
177(1)155,
182(1)183,
183(2)253,
184(1)1,
185(1)15,
185(2)277,
189(1)129,
190(2)241,
192(1)3,
192(2)201,
224(1)291
- regular,
127(2)287,
143(1)51,
146(1)321,
148(2)207,
149(1)101,
152(2)251,
154(1)3,
155(2)291,
156(1)71,
159(1)137,
160(1)185,
163(1)1,
163(1)55,
163(1)309,
165(2)325,
169(2)185,
171(1)281,
172(1)175,
174(1)1,
174(1)251,
174(1)259,
174(1)275,
176(1)175,
178(1)1,
178(1)103,
179(1)251,
179(1)319,
179(1)427,
180(1)325,
183(1)143,
186(1)135,
190(2)115,
191(1)37,
195(2)183,
209(1)163,
215(1)69
- result,
137(2)253,
141(1)69,
147(1)117,
148(2)281,
151(2)487,
157(1)101,
160(1)321,
163(1)99,
164(1)29,
168(2)267,
176(1)111,
177(1)27,
177(1)155,
179(1)397,
188(1)129,
207(1)43,
215(1)383,
225(1)113
- two-way,
161(1)141
- way, two-,
161(1)141