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