cs.FLSep 3, 2026

Relative Prime Factorization and Finite-State Presentations under Fixed Finite-Monoid Observation

Authors: Takayuki Kuriyama

Abstract

Let LΣL\subseteqΣ^* and fix a morphism h:ΣMh:Σ^*\to M into a finite monoid. We study exact factorization and canonical presentation in the relative syntactic congruence θL,h:=Lkerhθ_{L,h}:=\equiv_L\cap\ker h. We separate unique factorization from finite direct presentation. An exhaustively computer-checked 3636-element quotient has a unique exact prime factorization for every live non-unit class, yet its valid prime-return rules contain an infinite family, so unique factorization does not imply the finite relative presentation property (FRP), even for a finite quotient. We lift the same defect to a nonregular context-free language with an infinite relative quotient and finite prime spectrum. To isolate the obstruction, we introduce the finite-state relative presentation property (FSRP), in which canonical valid right-hand-side languages are represented by finite residual controllers, and prove FRPFSRP\mathrm{FRP}\subsetneq\mathrm{FSRP}. We then introduce prime-target left-division determinism (PTLD), which implies unique exact factorization, tail exactness, tail determinism, and a quadratic bound on valid rules. A nonregular deterministic context-free example with a finite group observer satisfies PTLD while lying outside every fixed (k,)(k,\ell)-substitutable class. Finally, for fixed hh we give a strong positive-data learner for the canonical PTLD presentation with polynomial-time hypothesis updates and a finite characteristic sample, together with a limit reconstruction of the canonical FSRP controller from weakly behaviorally correct CFG-valued learners.

Explore similar work

May 12, 2026cs.FL

Finite Sentence-Interface Control for Learning Bounded-Fan-Out Linear MCFGs under Fixed Monoid Typing

We study positive-data learning of bounded-fan-out linear multiple context-free grammars under a fixed explicit finite monoid homomorphism hh. The main obstacle beyond the context-free case is that an MCFG nonterminal derives a tuple whose components may be placed in a surrounding sentence in different orders. We introduce sentence-interface types as finite external control objects for such tuple occurrences. A type records the permutation of tuple components in the final sentence together with the hh-values of the boundary intervals between them. For reduced working binary linear nondeleting MCFG presentations whose string languages satisfy (f,h)(f,h)-tuple substitutability, we build a typed refinement, a finite characteristic sample, and a canonical positive-data learner. Once the sample contains this characteristic sample and remains contained in the target language, the learner reconstructs the language exactly. Consequently, for fixed fan-out bound ff and fixed explicit hh, the resulting class is identifiable in the limit from positive data. Moreover, the hypothesis associated with any given finite sample is constructible in polynomial time for fixed ff and fixed hh, including output size. Thus sentence-interface control is the finite mechanism that lifts fixed-hh distributional reconstruction from context-free grammars to bounded-fan-out linear MCFGs.
Takayuki Kuriyama
May 11, 2026math.GR

Every finite group admits a just finite presentation

A finite presentation < X | R > of a finite group is called `just finite' if removing any relation from R results in a presentation for an infinite group. It has been an open question (Kourovka Notebook, Problem 21.10) whether every finite group admits such a presentation. We resolve this conjecture in the affirmative.
Marc Lackenby
Jan 18, 2026cs.FL

Learning Deterministic Finite-State Machines from the Prefixes of a Single String is NP-Complete

It is well known that computing a minimum deterministic finite automaton consistent with a given set of positive and negative examples is NP-hard. Previous work has identified conditions on the input sample under which the problem becomes tractable or remains hard. In this paper, we study the computational complexity of the case where the input sample is prefix-closed. This formulation is equivalent to computing a minimum Moore machine consistent with observations along its runs. We show that the problem is NP-hard to approximate when the sample set consists of all prefixes of binary strings. Furthermore, we show that the problem remains NP-hard as a decision problem even when the sample set consists of the prefixes of a single binary string. Our argument also extends to the corresponding problem for Mealy machines.
Radu Cosmin Dumitru, Ryo Yoshinaka, Ayumi Shinohara