Closures of regular languages for profinite topologies.

DOI10.1007/S00233-014-9574-3zbMATH Open1307.20048OpenAlexW2114961618MaRDI QIDQ467504FDOQ467504

Authors: Jorge Almeida, José Carlos Costa, Marc Zeitoun

Publication date: 3 November 2014

Published in: Semigroup Forum (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1822/27493

Recommendations

scientific article; zbMATH DE number 1773080
scientific article; zbMATH DE number 1740161
Recognizing pro-\(\mathrm{R}\) closures of regular languages
Polynomial closure of group languages and open sets of the Hall topology
Finite state automata: a geometric approach

regular languages pseudovarieties of finite semigroups aperiodic semigroups pointlike sets profinite topology topological closure

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70) Varieties and pseudovarieties of semigroups (20M07) Semigroups in automata theory, linguistics, etc. (20M35)

Cites Work

Title not available (Why is that?)
On algorithmic problems for joins of pseudovarieties
Title not available (Why is that?)
The \(\mathfrak q\)-theory of finite semigroups.
Theorems on Compact Totally Disconnected Semigroups and Lattices
Extending partial automorphisms and the profinite topology on free groups
A SYNTACTICAL PROOF OF LOCALITY OF DA
A constructive version of the Ribes-Zalesskiĭ product theorem.
INEVITABLE GRAPHS: A PROOF OF THE TYPE II CONJECTURE AND SOME RELATED DECISION PROCEDURES
A Conjecture on the Hall Topology for the Free Group
ASH'S TYPE II THEOREM, PROFINITE TOPOLOGY AND MALCEV PRODUCTS: PART I
On The Profinite Topology on a Free Group
Title not available (Why is that?)
Topologies for the free monoid
On some systems of equations with constraints in a free group. -- Addenda.
Pointlike sets: the finest aperiodic cover of a finite semigroup
Iterated periodicity over finite aperiodic semigroups
Complete reducibility of systems of equations with respect to \(\mathbf R\).
Some algorithmic problems for pseudovarieties
McCammond’s normal forms for free aperiodic semigroups revisited
Profinite semigroups and applications.
APERIODIC POINTLIKES AND BEYOND
COMPLETE REDUCIBILITY OF THE PSEUDOVARIETY LS1
Defining Relations and the Algebraic Structure of the Group SL₂ over Integral Hamilton Quaternions
Title not available (Why is that?)
On the Decidability of Iterated Semidirect Products with Applications to Complexity
A NEW PROOF OF THE RHODES TYPE II CONJECTURE
On Pointlike Sets and Joins of Pseudovarieties
NORMAL FORMS FOR FREE APERIODIC SEMIGROUPS
Title not available (Why is that?)
Title not available (Why is that?)
Complete reducibility of pseudovarieties.
The word problem for \(\omega \)-terms over DA
An automata-theoretic approach to the word problem for \(\omega\)-terms over R

Cited In (7)

POLYNOMIAL CLOSURE AND TOPOLOGY
Title not available (Why is that?)
On the complexity of computing the profinite closure of a rational language
Factoriality and the Pin-Reutenauer procedure
McCammond’s normal forms for free aperiodic semigroups revisited
Recognizing pro-\(\mathrm{R}\) closures of regular languages
Profinite topologies

This page was built for publication: Closures of regular languages for profinite topologies.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q467504)