The pseudovariety $J$ is hyperdecidable
From MaRDI portal
Publication:4385676
DOI10.1051/ita/1997310504571zbMath0928.20046OpenAlexW157114451MaRDI QIDQ4385676
Publication date: 12 September 1999
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/92573
implicit operationsrecognizable languagespseudovarieties of finite semigroupsemptiness problemdecidable problemshyperdecidabilitypseudovariety closure of languages
Formal languages and automata (68Q45) Varieties and pseudovarieties of semigroups (20M07) Algebraic theory of languages and automata (68Q70) Decidability of theories and sets of sentences (03B25) Semigroups in automata theory, linguistics, etc. (20M35) Quasivarieties (08C15)
Related Items
ON THE HYPERDECIDABILITY OF PSEUDOVARIETIES OF GROUPS ⋮ PROFINITE METHODS IN SEMIGROUP THEORY ⋮ Pointlike sets and separation: a personal perspective ⋮ Pointlike sets for varieties determined by groups ⋮ On Upper and Lower Bounds on the Length of Alternating Towers ⋮ Some reducibility properties for pseudovarieties of the form DRH ⋮ Conelikes and ranker comparisons ⋮ First-order separation over countable ordinals ⋮ Separability by piecewise testable languages is \textsc{PTime}-complete ⋮ Pointlike sets with respect to R and J. ⋮ SC-hyperdecidability of \(\mathbf R\) ⋮ Profinite topologies ⋮ HYPERDECIDABLE PSEUDOVARIETIES AND THE CALCULATION OF SEMIDIRECT PRODUCTS
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The algebra of implicit operations
- Pointlike sets: the finest aperiodic cover of a finite semigroup
- INEVITABLE GRAPHS: A PROOF OF THE TYPE II CONJECTURE AND SOME RELATED DECISION PROCEDURES
- Undecidability of the identity problem for finite semigroups
- On the hyperdecidability of semidirect products of pseudovarieties
- HYPERDECIDABLE PSEUDOVARIETIES AND THE CALCULATION OF SEMIDIRECT PRODUCTS
- ON THE DECIDABILITY OF THE MEMBERSHIP PROBLEM OF THE PSEUDOVARIETY J∨B
