"FDT is Undecidable for Finitely Presented Monoids with Solvable Word Problems."

Friedrich Otto, Andrea Sattler-Klein (1997)

Details and statistics

DOI: 10.1007/BFB0036200

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-17

a service of  Schloss Dagstuhl - Leibniz Center for Informatics