Last update: Sun Oct 15 02:56:11 MDT 2017
@Article{Pin:1996:PCG,
author = "Jean-Eric Pin",
title = "Polynomial closure of group languages and open sets of
the {Hall} topology",
journal = j-THEOR-COMP-SCI,
volume = "169",
number = "2",
pages = "185--200",
day = "05",
month = dec,
year = "1996",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:20:29 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=169&issue=2;
http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1996&volume=169&issue=2&aid=2323",
acknowledgement = ack-nhfb,
classification = "C4210L (Formal languages and computational
linguistics); C4220 (Automata theory)",
conflocation = "Jerusalem, Israel; 11-14 July 1994",
conftitle = "21st International Colloquium on Automata, Languages,
and Programming",
corpsource = "LITP/IBP, Paris VII Univ., France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "algebra; algebraic characterization; automata theory;
combinatorics; finite automata; formal languages; group
languages; Hall topology; open sets; polynomial
closure; recognizable languages; regular languages;
topology",
pubcountry = "Netherlands",
sponsororg = "Eur. Assoc. Theor. Comput. Sci",
treatment = "P Practical",
}