Entry Hardin:1986:PTR 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{Hardin:1986:PTR,
author = "T. Hardin and A. Laville",
title = "Proof of termination of the rewriting system {SUBST}
on {CCL}",
journal = j-THEOR-COMP-SCI,
volume = "46",
number = "2--3",
pages = "305--312",
month = "????",
year = "1986",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory)",
corpsource = "Dept. Inf., Reims Univ., France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "combinatorial mathematics; equivalence theorem;
programming theory; rewriting; termination",
pubcountry = "Netherlands A10",
treatment = "T Theoretical or Mathematical",
}
Related entries
- CCL,
65(3)271,
65(3)291
- equivalence,
35(1)43,
35(2)313,
36(1)21,
36(1)113,
37(2)151,
37(2)183,
38(2)157,
39(1)27,
39(1)z,
41(1)105,
41(2)223,
42(1)1,
43(2)213,
44(2)237,
46(2)107,
46(2)175,
47(1)39,
47(1)71,
47(3)247,
47(3)263,
47(3)299,
48(2)145,
48(2)329,
49(2)185,
49(2)z,
50(3)241,
52(1)77,
52(3)177,
52(3)307,
53(1)67,
53(2)225,
58(1)183,
59(1)115,
63(1)19,
63(2)223,
64(1)39,
64(3)221,
66(1)1,
67(1)65
- proof,
35(2)345,
36(2)251,
39(1)27,
39(1)47,
39(1)z,
41(1)121,
42(2)123,
43(1)91,
43(2)345,
44(2)127,
44(3)333,
46(2)261,
48(2)229,
50(3)241,
52(3)239,
52(3)281,
54(2)199,
57(2)161,
57(2)317,
59(3)317,
61(2)225,
62(3)311,
63(1)91,
65(1)1,
65(1)35,
65(2)149,
66(1)87,
67(1)87,
67(2)203,
68(2)123,
68(3)267,
68(3)333,
69(1)69,
69(3)243
- rewriting,
35(1)71,
35(2)129,
35(2)337,
37(1)77,
37(2)123,
37(2)217,
40(2)85,
43(2)149,
45(1)1,
45(1)87,
45(3)293,
47(1)27,
48(2)201,
51(1)27,
52(1)37,
52(3)205,
55(2)141,
56(1)37,
56(3)277,
57(2)205,
61(1)67,
61(1)83,
61(2)317,
65(3)271,
65(3)291,
67(1)19,
67(2)143,
67(2)173,
67(2)203,
67(2)261,
67(2)283,
67(2)303,
68(3)319
- termination,
43(2)123,
50(3)285,
56(3)345,
58(1)263,
61(2)225,
62(1)187,
66(3)333
- theorem,
35(2)129,
37(1)51,
37(1)77,
37(2)183,
38(1)123,
38(1)137,
38(2)143,
39(2)135,
39(2)155,
43(1)91,
43(1)99,
43(2)315,
44(2)127,
44(3)333,
47(1)1,
48(1)1,
48(2)183,
48(2)201,
49(1)1,
49(2)283,
51(1)117,
52(1)1,
52(1)145,
52(3)205,
52(3)239,
53(1)125,
53(2)169,
54(1)3,
54(1)29,
54(2)249,
56(3)277,
57(2)161,
57(2)239,
59(1)133,
59(3)287,
61(1)17,
61(2)279,
64(1)1,
64(1)15,
64(3)331,
65(2)149,
65(3)271,
67(2)173,
67(2)203,
68(1)89,
68(3)277,
69(3)243