SC-hyperdecidability of R

Theoretical Computer Science

Volumn 255, Issue 1-2, 2001, Pages 569-591

  Almeida, Jorge ^a   Silva, Pedro V ^a  

^a UNIVERSITY OF PORTO   (Portugal)

Author keywords

Graph labelling; Hyperdecidability; Monoid; Pseudovariety; R trivial

Indexed keywords

ALGORITHMS; COMPUTABILITY AND DECIDABILITY; COMPUTATIONAL LINGUISTICS; THEOREM PROVING;

GRAPH LABELLING;

GRAPH THEORY;

EID: 0034911358     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(99)00329-1     Document Type: Article

References (12)

1. Hyperdecidable pseudovarieties and the calculation of semidirect products
2. On the hyperdecidability of semidirect products of pseudovarieties
3. Profinite categories and semidirect products
4. The pseudovariety J is hyperdecidable
5. Inevitable graphs: A proof of the type II conjecture and some related decision procedures
6. Ash's type II theorem, profinite topology and Malcev products
7. On pointlike sets and joints of pseudovarieties
8. Categories as algebra: An essential ingredient in the theory of monoids