Entry DeFelice:1988:FBS 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{DeFelice:1988:FBS,
author = "Clelia {De Felice}",
title = "Finite biprefix sets of paths in a graph",
journal = j-THEOR-COMP-SCI,
volume = "58",
number = "1-3",
pages = "103--128",
month = jun,
year = "1988",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ di Napoli",
affiliationaddress = "Naples, Italy",
classification = "723; 921; B0250 (Combinatorial mathematics); B6120B
(Codes); C1160 (Combinatorial mathematics); C1260
(Information theory)",
conference = "Thirteenth International Colloquium on Automata,
Languages and Programming",
conflocation = "Rennes, France; 15-19 July 1986",
conftitle = "Thirteenth International Colloquium on Automata,
Languages and Programming",
corpsource = "Dipartimento di Matematica e Appl., Napoli Univ.,
Italy",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Cesari-Sch{\"u}tzenberger Algorithm; Codes of Paths in
a Graph; Codes, Symbolic; Computer
Programming--Algorithms; Finite Biprefix Sets; Graph
Theory; Integration of Codes; Mathematical Techniques;
codes; combinatorial theory; decoding; double-infinite
paths; finite biprefix sets; graph; graph theory;
integration; maximal biprefix codes of words",
meetingaddress = "Rennes, Fr",
meetingdate = "Jul 1986",
meetingdate2 = "07/86",
pubcountry = "Netherlands",
sponsororg = "Eur. Assoc. Theor. Comput. Sci",
treatment = "T Theoretical or Mathematical",
}
Related entries
- Algorithms, Programming-,
58(0)3,
58(1)3,
58(1)143,
58(1)183,
59(1)115,
59(3)297,
60(3)255,
60(3)341,
62(0)3,
62(1)67,
62(1)105,
62(1)123,
63(2)157,
63(3)295,
64(1)39,
64(1)83,
64(1)107,
64(3)343,
65(1)1,
66(2)157,
66(2)181,
67(1)65
- B0250,
36(2)319,
38(1)123,
38(2)249,
38(2)293,
38(2)343,
40(2)329,
41(2)141,
41(2)185,
41(2)325,
43(1)99,
45(3)261,
48(1)95,
53(2)201,
53(2)281,
54(2)181,
54(2)215,
54(2)237,
54(2)341,
55(1)87,
56(2)223,
56(2)233,
57(1)153,
58(1)209,
58(1)325,
61(2)175,
61(2)307,
61(2)317,
64(1)25,
64(1)67,
64(1)97,
64(1)119,
65(2)149,
65(2)153,
68(1)89
- B6120B,
38(1)123,
40(1)3,
41(2)215,
48(2)283,
51(1)215,
54(2)165,
56(3)339,
63(2)157,
66(1)45,
68(3)253
- biprefix,
35(2)295,
51(1)117
- C1260,
35(2)295,
36(1)99,
37(1)77,
41(2)215,
48(2)283,
51(1)215,
54(2)165,
56(3)339,
57(1)97,
57(1)131,
57(2)283,
63(2)157,
63(2)185,
65(2)143,
65(2)171,
65(2)249,
65(2)z,
68(2)175
- code,
35(2)295,
36(1)99,
36(2)173,
38(1)123,
40(1)3,
41(1)61,
41(2)215,
41(2)289,
48(2)283,
51(1)215,
54(2)165,
56(1)59,
56(3)339,
57(2)283,
63(2)157,
65(0)123,
65(2)171,
65(2)265,
66(1)27,
66(1)45,
68(3)239,
68(3)253
- information,
35(2)295,
36(1)99,
37(1)77,
41(2)215,
43(2)149,
44(1)69,
48(2)283,
49(2)171,
49(2)185,
51(1)215,
54(2)165,
56(3)339,
57(1)97,
57(1)131,
57(2)283,
62(1)3,
62(1)39,
62(3)251,
63(1)91,
63(2)157,
63(2)185,
65(1)85,
65(2)143,
65(2)171,
65(2)249,
65(2)z,
68(2)175,
68(3)239
- mathematical,
36(2)145,
45(1)1,
57(0)3,
57(1)131,
57(1)147,
57(1)153,
58(0)3,
58(1)17,
58(1)143,
58(1)183,
58(1)201,
58(1)209,
58(1)263,
58(1)325,
58(1)361,
58(1)379,
59(3)277,
59(3)297,
60(1)1,
60(3)297,
61(2)121,
61(2)175,
61(2)225,
61(2)289,
61(2)299,
61(2)307,
62(1)221,
62(3)235,
62(3)251,
63(1)43,
63(1)63,
63(2)223,
63(3)239,
63(3)253,
63(3)275,
63(3)295,
64(1)1,
64(1)15,
64(1)83,
64(1)107,
64(1)125,
64(2)135,
64(2)159,
65(0)123,
65(2)123,
65(2)131,
65(2)143,
65(2)149,
65(2)153,
65(2)189,
65(2)197,
65(2)213,
65(2)221,
65(2)243,
65(2)249,
65(2)265,
66(0)117,
66(2)137,
66(2)157,
66(2)181,
66(2)205,
67(1)5,
67(1)37,
67(1)55,
67(1)111,
67(1)115
- maximal,
36(1)99,
38(1)1,
40(1)3,
43(2)149,
53(2)187,
56(3)339,
61(1)33,
63(2)157,
64(1)125,
64(3)221
- path,
36(1)27,
37(1)77,
40(2)257,
40(2)323,
43(2)213,
48(2)273,
57(1)131,
57(1)153,
68(1)1,
68(2)155
- Programming--Algorithms,
58(0)3,
58(1)3,
58(1)143,
58(1)183,
59(1)115,
59(3)297,
60(3)255,
60(3)341,
62(0)3,
62(1)67,
62(1)105,
62(1)123,
63(2)157,
63(3)295,
64(1)39,
64(1)83,
64(1)107,
64(3)343,
65(1)1,
66(2)157,
66(2)181,
67(1)65
- symbolic,
44(1)17,
63(2)157,
65(0)123,
65(2)131,
65(2)243,
65(2)265,
65(2)z
- technique,
39(2)319,
40(1)67,
40(2)101,
45(1)87,
46(2)261,
48(1)75,
49(1)81,
49(2)171,
50(2)137,
50(3)323,
51(1)53,
52(3)193,
53(2)169,
53(2)281,
54(1)53,
54(1)87,
54(1)129,
54(2)315,
57(0)3,
57(1)97,
57(1)131,
57(1)147,
57(1)153,
58(1)209,
59(1)157,
59(3)297,
61(2)299,
63(3)275,
63(3)295,
64(1)107,
64(2)135,
64(2)175,
65(1)1,
65(2)123,
65(2)131,
65(2)149,
65(2)153,
65(2)189,
65(2)197,
65(2)213,
65(2)243,
65(2)249,
66(0)117,
66(1)45,
66(2)137,
67(1)5,
67(1)37,
67(1)87,
68(3)267,
69(1)1
- word,
35(1)1,
35(1)115,
35(2)337,
38(1)117,
38(1)137,
39(2)281,
40(1)13,
41(1)61,
43(1)59,
44(1)107,
44(2)175,
44(2)199,
45(1)63,
47(2)191,
47(3)335,
48(1)35,
48(1)127,
52(1)1,
53(2)319,
54(2)139,
55(2)141,
56(2)233,
56(3)253,
56(3)339,
58(1)231,
60(3)255,
60(3)285,
61(1)1,
65(2)171,
65(2)221,
65(2)z,
69(3)319