Recognizing pro-\(\mathrm{R}\) closures of regular languages
From MaRDI portal
Publication:2171905
DOI10.1515/forum-2019-0158OpenAlexW4286697147MaRDI QIDQ2171905
Jorge Almeida, Marc Zeitoun, José Carlos Costa
Publication date: 12 September 2022
Published in: Forum Mathematicum (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1905.10460
regular languageomega-termfree profinite semigroupalgebraic recognitionprofinite closureR-trivial semigroupunary semigroup
Varieties and pseudovarieties of semigroups (20M07) Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35) Topological and differentiable algebraic systems (22A99)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Closures of regular languages for profinite topologies.
- Tameness of pseudovariety joins involving R.
- An automata-theoretic approach to the word problem for \(\omega\)-terms over R
- The word problem for omega-terms over the Trotter-Weil hierarchy
- Profinite topologies
- Pointlike sets with respect to R and J.
- Complete reducibility of systems of equations with respect to \(\mathbf R\).
- Separating Regular Languages with First-Order Logic
- INEVITABLE GRAPHS: A PROOF OF THE TYPE II CONJECTURE AND SOME RELATED DECISION PROCEDURES
- Undecidability of the identity problem for finite semigroups
- Equations in free groups are not finitely approximable
- Defining Relations and the Algebraic Structure of the Group SL2 over Integral Hamilton Quaternions
- On the Decidability of Iterated Semidirect Products with Applications to Complexity
- On the extension problem for partial permutations
This page was built for publication: Recognizing pro-\(\mathrm{R}\) closures of regular languages
