Polynomial closure of group languages and open sets of the Hall topology
type: Item
instance of: scholarly article
title: Polynomial closure of group languages and open sets of the Hall topology
zbMATH Open document ID: 0877.68076
DOI: 10.1016/S0304-3975(96)00120-X
author: Jean-Éric Pin
published in: Theoretical Computer Science
publication date: 1997-02-27T00:00:00Z
review text: The aim of this paper is to show that the two classes of recognizable (or regular) languages of the title are actually the same. But a title has to be short and ours does not mention two other important characterizations given in this paper: an algebraic characterization, on which our proofs rely, and a more algorithmic one in terms of finite automata. This gives four possible points of view to look at our class and so, the reader may choose between combinatorics, topology, algebra or automata according to her or his preferences. We present the language perspective, the topological aspects, the algebraic characterization and the connections with automata in this order.
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 983812
zbMATH Keywords: group languages
zbMATH Keywords: Hall topology
zbMATH Keywords: polynomial closure
zbMATH Keywords: algebraic characterization
zbMATH Keywords: finite automata
MaRDI profile type: Publication
cites work: Q4872086
cites work: INEVITABLE GRAPHS: A PROOF OF THE TYPE II CONJECTURE AND SOME RELATED DECISION PROCEDURES
cites work: Q3859267
cites work: Q4079524
cites work: Q4132170
cites work: A topology for free groups and related groups
cites work: ASH'S TYPE II THEOREM, PROFINITE TOPOLOGY AND MALCEV PRODUCTS: PART I
cites work: Q4271218
cites work: Q3697241
cites work: Q3738581
cites work: Q3697247
cites work: Q3769981
cites work: Q3763607
cites work: A topological approach to a conjecture of Rhodes
cites work: Topologies for the free monoid
cites work: Logic, semigroups and automata on words
cites work: A Conjecture on the Hall Topology for the Free Group
cites work: Une topologie du monoide libre
cites work: Sur mon article ''Une topologie du monoide libre''
cites work: On The Profinite Topology on a Free Group
cites work: THE PRO-p TOPOLOGY OF A FREE GROUP AND ALGORITHMIC PROBLEMS IN SEMIGROUPS
cites work: Sur le produit de concatenation non ambigu
cites work: The product of rational languages
cites work: Classifying regular events in symbolic logic
full work available at URL: s0304-3975(96)00120-x
OpenAlex ID: W1520554460
description: scientific article; zbMATH DE number 983812