The pseudovariety $J$ is hyperdecidable
From MaRDI portal
Publication:4385676
DOI10.1051/ita/1997310504571zbMath0928.20046MaRDI 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 operations; recognizable languages; pseudovarieties of finite semigroups; emptiness problem; decidable problems; hyperdecidability; pseudovariety closure of languages
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, Some reducibility properties for pseudovarieties of the form DRH, ON THE HYPERDECIDABILITY OF PSEUDOVARIETIES OF GROUPS, PROFINITE METHODS IN SEMIGROUP THEORY, SC-hyperdecidability of \(\mathbf R\), Separability by piecewise testable languages is \textsc{PTime}-complete, Pointlike sets with respect to R and J., Pointlike sets for varieties determined by groups, On Upper and Lower Bounds on the Length of Alternating Towers
Cites Work
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item