Sur la liaison entre problèmes combinatoires et algorithmiques

DOI10.1016/0304-3975(81)90029-3zbMATH Open0469.03004OpenAlexW2099955728MaRDI QIDQ1156785FDOQ1156785

Authors: Yu. M. Vazhenin 

Publication date: 1981

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(81)90029-3

zbMATH Keywords

semigroupscombinatorial problemsalgorithmic problems

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Undecidability and degrees of sets of sentences (03D35)

Cites Work

• Title not available (Why is that?)
• Recursive unsolvability of a problem of Thue
• Das Identitätsproblem für Gruppen mit einer definierenden Relation
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (1)

• Semigroups with one defining relation whose elementary theories are solvable

This page was built for publication: Sur la liaison entre problèmes combinatoires et algorithmiques

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