Sur la liaison entre problèmes combinatoires et algorithmiques

DOI10.1016/0304-3975(81)90029-3zbMath0469.03004OpenAlexW2099955728MaRDI QIDQ1156785

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

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

Related Items (1)

Semigroups with one defining relation whose elementary theories are solvable

Cites Work

• Das Identitätsproblem für Gruppen mit einer definierenden Relation
• Recursive Unsolvability of a problem of Thue
• Unnamed Item
• Unnamed Item
• Unnamed Item

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