The pseudovariety J is hyperdecidable

DOI10.1051/ITA/1997310504571MaRDI QIDQ4385676zbMATH OpenOpenAlexFDO

Authors Jorge Almeida, Marc Zeitoun

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

zbMATH Keywords

decidable problemsemptiness problemhyperdecidabilityimplicit operationspseudovarieties of finite semigroupspseudovariety closure of languagesrecognizable languages

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Quasivarieties (08C15) Varieties and pseudovarieties of semigroups (20M07) Semigroups in automata theory, linguistics, etc. (20M35) Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)

Recommendations

• On the hyperdecidability of semidirect products of pseudovarieties
• ON THE HYPERDECIDABILITY OF PSEUDOVARIETIES OF GROUPS
• ON HYPERDECIDABLE PSEUDOVARIETIES OF SIMPLE SEMIGROUPS
• ON THE DECIDABILITY OF THE MEMBERSHIP PROBLEM OF THE PSEUDOVARIETY J∨B
• HYPERDECIDABLE PSEUDOVARIETIES AND THE CALCULATION OF SEMIDIRECT PRODUCTS
• Type II theorem and hyperdecidability of pseudovarieties of groups
• Irreducibility of certain pseudovarieties¹
• On a locality-like property of the pseudovariety J
• scientific article; zbMATH DE number 1972777
• Complete reducibility of pseudovarieties.

Cites work

• scientific article; zbMATH DE number 4008680 (Why is no real title available?)
• scientific article; zbMATH DE number 4028925 (Why is no real title available?)
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 3495598 (Why is no real title available?)
• scientific article; zbMATH DE number 798167 (Why is no real title available?)
• HYPERDECIDABLE PSEUDOVARIETIES AND THE CALCULATION OF SEMIDIRECT PRODUCTS
• INEVITABLE GRAPHS: A PROOF OF THE TYPE II CONJECTURE AND SOME RELATED DECISION PROCEDURES
• ON THE DECIDABILITY OF THE MEMBERSHIP PROBLEM OF THE PSEUDOVARIETY J∨B
• On the hyperdecidability of semidirect products of pseudovarieties
• Pointlike sets: the finest aperiodic cover of a finite semigroup
• The algebra of implicit operations
• Undecidability of the identity problem for finite semigroups

Cited in

(19)

• Separability by piecewise testable languages is \textsc{PTime}-complete
• Profinite topologies
• Implicit operations on finite \({\mathcal J}\)-trivial semigroups and a conjecture of I. Simon
• Pointlike sets with respect to R and J.
• Pointlike sets for varieties determined by groups
• Hyperdecidability of pseudovarieties of orthogroups
• On upper and lower bounds on the length of alternating towers
• On the hyperdecidability of semidirect products of pseudovarieties
• HYPERDECIDABLE PSEUDOVARIETIES AND THE CALCULATION OF SEMIDIRECT PRODUCTS
• Some reducibility properties for pseudovarieties of the form DRH
• POLYNOMIAL CLOSURE AND TOPOLOGY
• ON THE HYPERDECIDABILITY OF PSEUDOVARIETIES OF GROUPS
• PROFINITE METHODS IN SEMIGROUP THEORY
• TAMENESS OF THE PSEUDOVARIETY OF ABELIAN GROUPS
• SC-hyperdecidability of R
• Conelikes and ranker comparisons
• First-order separation over countable ordinals
• Pseudovarieties of semigroups
• Pointlike sets and separation: a personal perspective

This page was built for publication: The pseudovariety $J$ is hyperdecidable

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