Last update: Thu Sep 27 02:46:57 MDT 2018
@Article{Spehner:1985:ESE,
author = "J.-C. Spehner",
title = "Entire systems of equations on a finite alphabet and
{Ehrenfeucht}'s conjecture",
journal = j-THEOR-COMP-SCI,
volume = "39",
number = "2--3",
pages = "171--188",
month = aug,
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 = "Inst. des Sci., Exactes et Appl., Univ. de Haute
Alsace, Mulhouse, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "automata theory; Ehrenfeucht conjecture; entire
systems of equations; finite alphabet; generalized
automaton; morphism; morphisms; shuffle automation",
language = "French",
pubcountry = "Netherlands A06",
treatment = "T Theoretical or Mathematical",
}