The pseudovariety $J$ is hyperdecidable

DOI10.1051/ita/1997310504571zbMath0928.20046MaRDI QIDQ4385676

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

implicit operations; recognizable languages; pseudovarieties of finite semigroups; emptiness problem; decidable problems; hyperdecidability; pseudovariety closure of languages

Mathematics Subject Classification ID

68Q45: Formal languages and automata

20M07: Varieties and pseudovarieties of semigroups

68Q70: Algebraic theory of languages and automata

03B25: Decidability of theories and sets of sentences

20M35: Semigroups in automata theory, linguistics, etc.

08C15: Quasivarieties

Related Items

HYPERDECIDABLE PSEUDOVARIETIES AND THE CALCULATION OF SEMIDIRECT PRODUCTS, ON THE HYPERDECIDABILITY OF PSEUDOVARIETIES OF GROUPS, PROFINITE METHODS IN SEMIGROUP THEORY, SC-hyperdecidability of \(\mathbf R\), Pointlike sets with respect to R and J., On Upper and Lower Bounds on the Length of Alternating Towers

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