Entry Madlener:1993:WCM 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{Madlener:1993:WCM,
author = "K. Madlener and P. Narendran and F. Otto and L.
Zhang",
title = "On weakly confluent monadic string-rewriting systems",
journal = j-THEOR-COMP-SCI,
volume = "113",
number = "1",
pages = "119--165",
day = "24",
month = may,
year = "1993",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:17:13 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1993&volume=113&issue=1;
http://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1993&volume=113&issue=1&aid=1298",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Fachbereich Inf., Kaiserslautern Univ., Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "completion procedure; congruence classes;
decidability; decidability results; decision problems;
finite; rewriting systems; validation problem; weakly
confluent monadic string-rewriting systems",
pubcountry = "Netherlands",
treatment = "P Practical; T Theoretical or Mathematical",
}
Related entries
- completion,
72(2)169,
72(2)z,
81(2)169,
85(2)231,
89(1)3,
99(1)65,
104(1)29,
105(1)7,
106(1)87,
107(2)277,
112(1)145
- confluent,
75(1)85,
93(2)321,
106(2)183,
108(1)25,
112(1)145,
122(1)201
- congruence,
71(3)281,
75(3)223,
76(2)261,
80(2)227,
96(2)325,
100(2)267,
114(1)173,
118(2)263,
123(2)273,
134(2)537,
136(2)471
- decidability,
71(1)29,
71(2)265,
71(3)281,
72(1)39,
73(3)295,
74(1)3,
74(1)71,
74(3)341,
78(2)347,
79(1)37,
79(1)263,
80(1)77,
80(2)227,
80(2)303,
81(1)137,
81(2)269,
81(2)289,
82(1)19,
82(1)131,
85(1)33,
85(2)253,
87(1)25,
87(2)287,
88(2)269,
88(2)325,
89(1)33,
91(1)71,
91(1)101,
94(1)1,
94(2)367,
95(1)115,
95(2)187,
96(2)325,
98(1)5,
98(2)199,
99(2)291,
101(1)143,
103(1)39,
103(1)143,
103(2)387,
106(1)87,
106(1)135,
106(2)337,
108(1)103,
108(2)237,
109(1)83,
110(1)145,
110(2)419,
112(2)311,
113(1)93,
114(1)93,
116(2)339,
117(1)39,
118(2)167,
118(2)193,
120(2)229,
121(1)71,
121(1)89,
123(2)315,
126(1)31,
126(1)113,
127(1)1,
127(1)69,
127(1)149,
127(2)229,
129(1)167,
129(2)419,
130(2)239,
131(2)243,
131(2)271,
131(2)431,
131(2)441,
132(1)37,
132(1)85,
132(1)129,
132(1)395,
134(1)107,
134(1)175,
134(2)287,
134(2)311,
134(2)329,
134(2)365,
135(2)345
- decision,
71(3)281,
72(1)39,
72(2)265,
74(1)71,
80(2)227,
81(1)137,
81(2)169,
82(1)19,
84(1)127,
84(2)199,
85(1)33,
93(2)279,
95(1)115,
98(1)137,
98(1)z,
106(2)351,
107(1)63,
110(2)419,
112(1)145,
112(2)371,
118(2)193,
119(1)173,
120(2)197,
123(2)183,
125(2)339,
126(2)183,
127(1)25,
128(1)179,
133(2)307,
134(2)329,
134(2)365,
134(2)387,
135(1)139
- monadic,
80(2)153,
83(2)323,
84(2)165,
88(1)139,
93(2)227,
97(2)233,
101(1)3,
103(1)143,
109(1)49,
116(1)151,
126(1)53,
126(1)97,
134(1)175
- Narendran, P.,
81(2)169
- procedure,
72(2)169,
72(2)265,
80(2)319,
81(2)169,
81(2)223,
82(1)19,
88(2)313,
91(2)265,
93(1)1,
95(1)97,
95(1)115,
97(1)67,
98(1)137,
102(1)1,
103(2)283,
103(2)387,
104(2)207,
106(1)87,
107(2)209,
110(2)419,
112(1)145,
115(1)3,
118(1)81,
119(1)173,
120(1)69,
123(1)55,
124(2)273,
128(1)179,
129(1)167,
133(2)267,
133(2)307
- result,
70(1)85,
73(1)47,
73(3)249,
73(3)279,
79(1)111,
79(1)137,
80(2)289,
85(2)305,
87(1)203,
87(2)229,
87(2)287,
88(2)231,
91(2)129,
92(2)249,
93(2)265,
94(2)161,
95(1)115,
97(1)143,
99(1)1,
104(1)3,
110(1)145,
116(1)195,
116(2)317,
120(2)197,
121(1)71,
125(2)243,
128(1)3,
134(2)387,
135(2)361,
136(2)507
- rewriting, string-,
134(1)175
- string-rewriting,
134(1)175
- weakly,
74(1)71,
82(2)409,
101(1)99,
120(2)197,
120(2)279