Last update: Wed Sep 26 02:11:46 MDT 2018
@Article{Capocelli:1994:FAU,
author = "Renato M. Capocelli and Luisa Gargano and Ugo
Vaccaro",
title = "A fast algorithm for the unique decipherability of
multivalued encodings",
journal = j-THEOR-COMP-SCI,
volume = "134",
number = "1",
pages = "63--78",
day = "07",
month = nov,
year = "1994",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:18:31 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1994&volume=134&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=1994&volume=134&issue=1&aid=1644",
acknowledgement = ack-nhfb,
classification = "B6120B (Codes); C4210 (Formal logic); C4240
(Programming and algorithm theory)",
conflocation = "Kyoto, Japan; 25-28 Aug. 1992",
conftitle = "Second International Colloquium on Words, Languages
and Combinatorics",
corpsource = "Dipartimento di Matematica, Rome Univ., Italy",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computational complexity; encoding; fast algorithm;
many-valued logics; multivalued encodings; running
time; source symbol; time complexity; unique
decipherability",
pubcountry = "Netherlands",
sponsororg = "Kyoto Sangyo Univ",
treatment = "T Theoretical or Mathematical",
}