Entry Narendran:1985:CRC 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{Narendran:1985:CRC,
author = "P. Narendran and F. Otto",
title = "Complexity results on the conjugacy problem for
monoids",
journal = j-THEOR-COMP-SCI,
volume = "35",
number = "2--3",
pages = "227--243",
month = feb,
year = "1985",
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 = "C4210 (Formal logic); C4240 (Programming and
algorithm theory)",
corpsource = "Gen Elect. Co., Res. and Dev. Center, Schenectady, NY,
USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "alphabet; computational complexity; conjugacy problem;
decidability; finite almost-confluent Thue system;
finite Church--Rosser Thue system; formal languages;
infinite Church--Rosser Thue system; monoids;
presentations; recursive functions; recursive Thue
systems; recursively enumerable degree",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- almost-confluent,
44(2)237
- alphabet,
35(2)179,
35(2)295,
37(3)357,
38(1)137,
39(2)171,
41(1)109,
46(2)175,
51(3)301,
52(1)1,
56(2)233,
60(3)255,
61(2)279,
63(1)1,
63(2)157,
63(3)333,
65(2)143,
65(2)153,
67(1)19,
67(1)121,
69(3)319
- Church--Rosser,
35(1)109,
35(2)337,
37(2)123,
39(2)123,
39(2)337,
49(1)13,
49(1)43,
65(3)271,
66(1)55,
68(3)319,
68(3)333
- confluent, almost-,
44(2)237
- conjugacy,
46(2)159,
47(1)27,
68(3)319
- decidability,
35(1)1,
35(2)191,
35(2)329,
35(2)337,
36(2)173,
37(2)123,
38(1)117,
39(2)281,
41(1)51,
41(1)105,
41(2)247,
44(2)199,
44(2)237,
46(1)83,
47(1)27,
47(1)39,
47(1)71,
47(2)225,
47(3)247,
48(2)257,
48(2)329,
49(1)43,
51(3)255,
52(3)177,
53(2)243,
55(1)1,
55(2)141,
58(1)231,
59(3)287,
61(2)259,
61(2)289,
64(3)305,
64(3)343,
65(2)265,
66(1)55,
67(1)5,
67(1)19,
67(1)129,
67(2)143,
67(2)303,
68(3)267,
68(3)319,
68(3)343
- degree,
36(1)59,
39(2)207,
40(2)319,
46(2)329,
51(3)265,
58(1)3
- enumerable,
35(2)261,
38(1)17,
41(1)1,
42(2)123,
55(2)183,
62(3)235
- infinite,
36(1)1,
37(1)51,
38(1)137,
39(2)281,
43(1)59,
43(1)99,
43(2)277,
43(2)315,
44(1)107,
44(2)175,
46(2)141,
47(1)15,
48(1)9,
49(2)87,
49(2)113,
49(2)z,
52(1)165,
54(2)139,
54(2)267,
54(2)277,
58(1)231,
59(1)115,
61(1)1,
61(1)25,
61(2)259,
65(2)143,
65(2)221,
65(2)z,
67(1)5,
67(2)303
- monoid,
35(2)179,
35(2)271,
37(3)245,
38(1)123,
39(1)3,
40(1)13,
40(2)85,
41(1)121,
41(2)215,
43(1)117,
44(3)333,
46(2)159,
46(2)319,
47(2)191,
48(2)183,
48(2)329,
49(1)13,
51(1)215,
52(1)59,
54(2)165,
55(2)183,
56(3)345,
57(2)239,
58(1)81,
58(1)201,
60(3)285,
64(3)271,
66(1)55,
66(2)117,
66(3)233,
67(1)19,
67(1)65,
67(2)143
- Narendran, P.,
35(2)337,
39(2)123,
40(2)323,
44(2)237,
47(1)27,
68(3)319
- Otto, F.,
39(2)319,
40(2)101,
47(1)27,
47(2)225,
67(2)143,
68(3)319
- presentation,
42(2)123,
46(2)319,
51(1)1
- recursive,
35(2)261,
36(1)1,
37(1)77,
38(1)17,
38(1)35,
39(1)15,
39(2)207,
40(2)323,
41(1)33,
41(2)289,
42(1)1,
42(2)123,
42(3)251,
44(3)307,
45(1)1,
45(2)193,
46(2)239,
47(2)121,
47(2)131,
47(3)299,
51(1)129,
52(3)281,
53(1)25,
53(1)z,
54(1)29,
57(2)327,
60(1)83,
60(3)297,
61(2)103,
62(0)3,
62(1)187,
62(3)289,
63(1)43,
63(3)253,
66(3)255,
66(3)289,
66(3)333,
68(3)303,
69(1)1
- recursively,
35(2)261,
38(1)17,
41(1)1,
42(2)123,
54(1)29,
55(2)183,
62(3)235,
68(3)303
- result,
35(1)1,
52(3)177,
58(1)143,
58(1)155,
61(2)259,
62(3)267,
65(1)35,
65(3)291,
66(2)157
- Rosser, Church-,
35(1)109,
35(2)337,
37(2)123,
39(2)123,
39(2)337,
49(1)13,
49(1)43,
65(3)271,
66(1)55,
68(3)319,
68(3)333
- Thue,
35(1)109,
35(2)337,
37(2)123,
39(2)123,
44(2)237,
47(2)225,
66(1)55,
68(3)319