Last update: Wed Sep 26 02:11:46 MDT 2018
@Article{Zhang:1993:DRS, author = "Liang Zhang and Weide D. Qiu", title = "Decompositions of recognizable strong maximal codes", journal = j-THEOR-COMP-SCI, volume = "108", number = "1", pages = "173--183", day = "01", month = feb, year = "1993", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Mon Jul 19 22:16:56 MDT 1999", bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1993&volume=108&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=108&issue=1&aid=1208", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", conflocation = "Kyoto, Japan; 28-31 Aug. 1990", conftitle = "International Colloquium on Words, Languages and Combinatorics", corpsource = "Dept. of Basic Courses, Shanghai Inst. of Urban Construction, China", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "codes; decompositions; formal languages; recognizable; strong maximal codes", pubcountry = "Netherlands", sponsororg = "Kyoto Sangyo Univ", treatment = "T Theoretical or Mathematical", }