Sur la liaison entre problèmes combinatoires et algorithmiques

DOI10.1016/0304-3975(81)90029-3MaRDI QIDQ1156785zbMATH OpenOpenAlexFDO

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

• scientific article; zbMATH DE number 3301426 (Why is no real title available?)
• scientific article; zbMATH DE number 3321276 (Why is no real title available?)
• scientific article; zbMATH DE number 3090995 (Why is no real title available?)
• Das Identitätsproblem für Gruppen mit einer definierenden Relation
• Recursive unsolvability of a problem of Thue

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)