Entry Bruyere:1998:MOL 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{Bruyere:1998:MOL,
author = "V{\'e}ronique Bruy{\`e}re and Denis Derencourt and
Michel Latteux",
title = "The meet operation in the lattice of codes",
journal = j-THEOR-COMP-SCI,
volume = "191",
number = "1--2",
pages = "117--129",
day = "30",
month = jan,
year = "1998",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:21:31 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1998&volume=191&issue=1-2;
http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
URL = "http://www.elsevier.com/cas/tree/store/tcs/sub/1998/191/1-2/2519.pdf",
acknowledgement = ack-nhfb,
classification = "C4210L (Formal languages and computational
linguistics)",
corpsource = "Fac. des Sci., Univ. de Mons-Hainaut, Belgium",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "codes; combinatorial characterization; formal
languages; free monoid; lattice of codes; meet
operation; rational maximal codes",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- Bruyère, Véronique,
148(2)227,
181(1)17,
204(1)11,
215(1)329,
218(1)107
- characterization,
138(2)391,
140(1)5,
142(1)89,
143(1)1,
146(1)5,
147(1)55,
148(1)33,
150(1)77,
154(1)67,
154(1)85,
154(2)247,
154(2)379,
156(1)289,
160(1)321,
162(1)5,
162(1)45,
163(1)245,
163(1)303,
164(1)287,
168(1)53,
169(2)185,
172(1)281,
175(2)239,
177(1)183,
179(1)301,
184(1)195,
186(1)1,
187(1)49,
189(1)1,
191(1)79,
193(1)113,
195(2)227,
197(1)246-1,
205(1)135,
205(1)195,
209(1)123,
215(1)31,
218(2)297,
219(1)319,
226(1)37
- code,
141(1)1,
144(1)161,
145(1)345,
147(1)165,
148(2)227,
148(2)325,
154(2)283,
155(2)425,
159(1)103,
160(1)145,
162(2)297,
163(1)145,
163(1)259,
164(1)223,
165(2)407,
172(1)309,
176(1)337,
181(2)337,
182(1)245,
183(1)3,
187(1)231,
188(1)231,
192(2)201,
196(1)347,
196(1)365,
197(1)246,
204(1)11,
215(1)345,
218(1)107
- Derencourt, Denis,
163(1)145
- free,
138(2)391,
141(1)331,
142(2)229,
145(1)229,
152(1)91,
153(1)271,
160(1)241,
163(1)55,
164(1)223,
165(2)325,
165(2)355,
168(1)105,
170(1)47,
175(2)393,
179(1)421,
183(1)83,
187(1)105,
191(1)145,
192(1)107,
197(1)189,
204(1)35,
204(1)131,
224(1)13,
224(1)157,
225(1)149
- Latteux, Michel,
178(1)275
- lattice,
143(1)51,
143(2)343,
148(1)67,
159(1)29,
159(2)245,
165(1)57,
165(2)391,
172(1)303,
175(2)337,
175(2)373,
178(1)237,
192(2)167,
207(1)105,
217(1)115,
217(1)157,
217(2)279,
217(2)291,
224(1)157,
226(1)29
- maximal,
143(2)309,
145(1)317,
146(1)331,
147(1)19,
148(1)57,
161(1)1,
166(1)83,
175(2)257,
181(1)91,
183(1)3,
188(1)231,
193(1)53,
204(1)11,
215(1)89,
218(1)107,
218(2)273
- meet,
165(2)391
- monoid,
145(1)229,
146(1)321,
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)219,
194(1)57,
197(1)246-2,
204(1)35,
204(1)131,
204(1)169,
208(1)3,
225(1)149
- operation,
141(1)53,
143(1)51,
148(1)171,
149(1)179,
149(2)201,
154(2)165,
155(1)1,
156(1)1,
157(2)215,
160(1)87,
161(1)301,
164(1)1,
165(2)391,
166(1)173,
167(1)131,
172(1)135,
173(1)151,
174(1)67,
175(1)183,
179(1)251,
180(1)17,
180(1)341,
181(2)379,
187(1)7,
190(2)363,
191(1)79,
192(2)167,
192(2)201,
192(2)259,
194(1)242-2,
195(1)61,
196(1)347,
198(1)131,
200(1)1,
205(1)317,
207(1)73,
216(1)159
- rational,
143(1)1,
145(1)229,
151(1)29,
151(1)z,
155(2)439,
159(1)43,
165(2)483,
167(1)73,
173(1)235,
174(1)259,
180(1)1,
188(1)45,
189(1)229,
194(1)1,
205(1)329,
209(1)287,
218(1)143,
221(1)41