Entry Kobayashi:1995:FPM 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{Kobayashi:1995:FPM,
author = "Yuji Kobayashi",
title = "A finitely presented monoid which has solvable word
problem but has no regular complete presentation",
journal = j-THEOR-COMP-SCI,
volume = "146",
number = "1--2",
pages = "321--329",
day = "24",
month = jul,
year = "1995",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:19:14 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=146&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=1995&volume=146&issue=1-2&aid=1898",
acknowledgement = ack-nhfb,
classification = "C4210L (Formal languages and computational
linguistics)",
corpsource = "Dept. of Inf. Sci., Toho Univ., Funabashi, Japan",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "finite complete rewriting systems; finitely presented
monoid; group theory; regular complete system;
rewriting systems; solvable word problem",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- complete,
138(2)273,
138(2)391,
141(1)337,
142(2)209,
143(1)51,
145(1)147,
146(1)243,
147(1)1,
147(1)69,
147(1)137,
152(2)251,
154(1)107,
154(2)247,
154(2)283,
160(1)185,
160(1)241,
161(1)307,
164(1)141,
164(1)287,
166(1)203,
168(1)53,
168(1)155,
170(1)145,
170(1)245,
172(1)195,
176(1)89,
179(1)421,
183(2)229,
184(1)61,
184(1)237,
189(1)239,
190(2)279,
192(2)259,
192(2)315,
193(1)53,
195(1)61,
197(1)244-2,
206(1)331,
211(1)339,
220(2)363,
221(1)157
- finitely,
138(2)391,
141(1)253,
149(1)101,
182(1)245,
200(1)135,
202(1)223,
204(1)169,
209(1)163
- group,
145(1)229,
150(1)77,
154(2)387,
161(1)157,
161(1)191,
163(1)259,
164(1)223,
165(2)275,
169(2)185,
176(1)347,
178(1)257,
180(1)17,
181(1)195,
183(2)187,
187(1)3,
187(1)27,
187(1)123,
187(1)263,
188(1)231,
191(1)145,
191(1)219,
192(2)287,
194(1)248,
204(1)233,
208(1)149,
225(1)177
- has,
137(2)279,
145(1)241,
204(1)205,
225(1)177
- monoid,
145(1)229,
148(2)227,
150(1)77,
158(1)81,
163(1)55,
163(1)259,
168(1)105,
172(1)135,
174(1)67,
178(1)257,
183(1)45,
183(1)93,
191(1)117,
191(1)219,
194(1)57,
197(1)246-2,
204(1)35,
204(1)131,
204(1)169,
208(1)3,
225(1)149
- presentation,
158(1)81,
161(1)263,
183(1)83,
197(1)244-2
- presented,
204(1)169
- regular,
127(2)287,
143(1)51,
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)161,
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
- solvable,
145(1)271,
160(1)145,
160(1)185,
172(1)273,
180(1)17
- which,
148(1)165,
163(1)145,
225(1)177
- word,
154(1)67,
154(2)387,
155(2)291,
155(2)349,
155(2)425,
156(1)119,
156(1)281,
158(1)35,
159(1)15,
159(1)43,
160(1)87,
161(1)141,
162(1)79,
163(1)1,
163(1)291,
163(1)309,
164(1)29,
164(1)165,
164(1)277,
165(2)295,
170(1)407,
172(1)67,
172(1)273,
174(1)1,
174(1)171,
178(1)129,
178(1)171,
178(1)205,
180(1)81,
180(1)341,
183(1)45,
183(1)83,
197(1)1,
197(1)57,
197(1)235,
198(1)1,
200(1)205,
204(1)87,
218(1)13,
218(1)41,
218(1)83,
218(1)95,
218(1)123,
218(1)135,
218(1)161,
223(1)73,
224(1)215,
225(1)129,
225(1)149