Last update: Thu Sep 27 02:46:57 MDT 2018
@Article{Imori:1985:PCS,
author = "M. Imori and H. Yamada",
title = "Periodic character sequences where identifying two
characters strictly reduces the period",
journal = j-THEOR-COMP-SCI,
volume = "38",
number = "2--3",
pages = "167--192",
month = jun,
year = "1985",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "C4220 (Automata theory)",
corpsource = "Fac. of Sci., Tokyo Univ., Japan",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "cellular automata; finite automata; homomorphic map;
periodic character sequences; primitive period",
pubcountry = "Netherlands A03",
treatment = "T Theoretical or Mathematical",
}