Last update: Thu Sep 27 02:46:57 MDT 2018
@Article{Leiss:1985:SSE,
author = "E. L. Leiss",
title = "On solving star equations",
journal = j-THEOR-COMP-SCI,
volume = "39",
number = "2--3",
pages = "327--332",
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 = "C4210 (Formal logic)",
corpsource = "Dept. of Comput. Sci., Houston Univ., TX, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "constant language; formal languages; language
equation; mapping; operations union; star equation;
uniqueness; unrestricted star",
pubcountry = "Netherlands A16",
treatment = "T Theoretical or Mathematical",
}