On the complexity of computing the profinite closure of a rational language
type: Item
instance of: scholarly article
title: On the complexity of computing the profinite closure of a rational language
zbMATH Open document ID: 1222.68106
published in: Theoretical Computer Science
publication date: 2011-10-10T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 5955928
zbMATH Keywords: finite automata
zbMATH Keywords: state complexity
zbMATH Keywords: profinite topology
author: Pierre-Cyrille Héam
MaRDI profile type: Publication
full work available at URL: j.tcs.2011.06.022
OpenAlex ID: W2032947973
cites work: Q3859267
cites work: Abelian pointlikes of a monoid
cites work: A polynomial time algorithm to compute the Abelian kernel of a finite monoid
cites work: A topology for free groups and related groups
cites work: Q4330723
cites work: ASH'S TYPE II THEOREM, PROFINITE TOPOLOGY AND MALCEV PRODUCTS: PART I
cites work: Extending partial automorphisms and the profinite topology on free groups
cites work: Q4540963
cites work: Q3763607
cites work: A topological approach to a conjecture of Rhodes
cites work: Topologies for the free monoid
cites work: Polynomial closure of group languages and open sets of the Hall topology
cites work: A Conjecture on the Hall Topology for the Free Group
cites work: On The Profinite Topology on a Free Group
cites work: Finite state automata: a geometric approach
DOI: 10.1016/J.TCS.2011.06.022
description: scientific article; zbMATH DE number 5955928