The flatness–word-problem characterization conjecture
Statement
Let be a finitely generated group, and let be a class of languages closed under inverse homomorphism.
Flatness–word-problem conjecture. is -flat if and only if the word problem of lies in .
This conjecture would connect the notion of -flatness with the word problem. It is refuted: the classes of poly-context-free, context-sensitive, and recursive languages provide counterexamples.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.