Regularity conjecture for finite-state string machines without a meta-vertex
Statement
Let a string machine be composed only of finite-state transducers, with the input and output categories of each transducer being tape categories. Suppose it has one free input in a tape category whose generating morphisms form a set and are all endomorphisms of the generating object . Assume its sole output is a state space , with some subset designated as accepting. An endomorphism in that contains no instances of the copy morphism is regarded as a string over . Regularity conjecture. Every language over accepted by this string machine is regular. The conjecture asserts that finite-state string machines without a meta-vertex have no more language-recognition power than finite automata; the paper presents a sketch intended to establish it, but the supplied text gives no resolution status.
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.