Closures of regular languages for profinite topologies

The Pin-Reutenauer algorithm gives a method, that can be viewed as a descriptive procedure, to compute the closure in the free group of a regular language with respect to the Hall topology. A similar descriptive procedure is shown to hold for the pseudovariety A of aperiodic semigroups, where the cl...

Full description

Bibliographic Details
Main Author: Almeida, Jorge (author)
Other Authors: Costa, José Carlos (author), Zeitoun, Marc (author)
Format: article
Language:eng
Published: 2014
Subjects:
Pseudovariety
Profinite semigroup
Profinite topology
Pointlike set
Regular language
Aperiodic semigroup
Topological closure
Science & Technology
Online Access:http://hdl.handle.net/1822/27493
Country:Portugal
Oai:oai:repositorium.sdum.uminho.pt:1822/27493

Internet

http://hdl.handle.net/1822/27493

Similar Items