Entry Hirshfeld:1996:PAD 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{Hirshfeld:1996:PAD,
author = "Yoram Hirshfeld and Mark Jerrum and Faron Moller",
title = "A polynomial algorithm for deciding bisimilarity of
normed context-free processes",
journal = j-THEOR-COMP-SCI,
volume = "158",
number = "1--2",
pages = "143--159",
day = "20",
month = may,
year = "1996",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:19:55 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=158&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=1996&volume=158&issue=1-2&aid=2002",
acknowledgement = ack-nhfb,
classification = "C4210L (Formal languages and computational
linguistics); C4240C (Computational complexity)",
corpsource = "Dept. of Comput. Sci., Edinburgh Univ., UK",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "bisimilarity; computational complexity; context-free
grammars; equivalence problem; normed context-free
processes; NP; polynomial algorithm; simple grammars;
upper bound",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- bisimilarity,
148(2)281,
176(1)205,
177(2)487,
179(1)397,
195(2)155,
198(1)159,
228(1)5
- bound,
139(1)355,
140(2)265,
140(2)301,
141(1)175,
143(2)335,
145(1)45,
145(1)271,
148(1)141,
151(1)163,
154(1)107,
154(2)165,
154(2)283,
155(2)411,
156(1)99,
156(1)315,
157(1)129,
157(2)139,
157(2)161,
157(2)185,
157(2)259,
161(1)301,
162(2)341,
163(1)177,
165(2)247,
168(1)105,
172(1)1,
172(1)293,
175(2)283,
175(2)373,
179(1)251,
179(1)301,
180(1)243,
181(1)45,
181(1)119,
181(2)307,
184(1)61,
185(1)47,
188(1)59,
188(1)117,
192(1)3,
194(1)163,
196(1)153,
197(1)95,
197(1)245-2,
201(1)63,
205(1)297,
209(1)47,
209(1)141,
209(1)389,
212(1)3
- context-free,
127(2)287,
137(2)177,
141(1)331,
142(1)3,
143(2)343,
147(1)87,
158(1)161,
161(1)23,
161(1)141,
161(1)205,
163(1)1,
164(1)207,
165(2)275,
165(2)463,
167(1)171,
168(2)241,
168(2)321,
180(1)353,
181(1)141,
183(1)21,
184(1)195,
185(1)15,
194(1)35,
197(1)189,
202(1)231,
215(1)349
- deciding,
139(1)315,
154(1)107,
170(1)445
- free, context-,
127(2)287,
137(2)177,
141(1)331,
142(1)3,
143(2)343,
147(1)87,
158(1)161,
161(1)23,
161(1)141,
161(1)205,
163(1)1,
164(1)207,
165(2)275,
165(2)463,
167(1)171,
168(2)241,
168(2)321,
180(1)353,
181(1)141,
183(1)21,
184(1)195,
185(1)15,
194(1)35,
197(1)189,
202(1)231,
215(1)349
- normed,
195(2)113
- NP,
137(2)279,
141(1)175,
145(1)111,
145(1)147,
147(1)55,
147(1)181,
148(2)207,
148(2)325,
150(1)1,
154(2)145,
154(2)283,
157(2)161,
158(1)221,
160(1)185,
164(1)59,
164(1)141,
174(1)97,
181(2)229,
189(1)239
- simple,
140(2)249,
144(1)101,
158(1)343,
162(2)245,
168(2)461,
175(1)127,
176(1)89,
180(1)169,
185(1)15,
187(1)117,
189(1)71,
191(1)245,
194(1)246-2,
195(1)3
- upper,
140(2)265,
145(1)45,
145(1)271,
148(1)141,
151(1)163,
156(1)315,
157(2)161,
163(1)177,
165(2)483,
168(1)105,
175(2)283,
181(1)119,
184(1)61,
193(1)1,
194(1)163