collaborators
Showing cs.FLShow all

6 papers · 1 filter

cs.FL2026

Observer--Fragmentation--Exposure Tradeoffs: From Rectangular CFG Exposure to Ordered MCFG Scheduling

Takayuki Kuriyama

We study finite resources governing exact positive reconstruction in fixed-observation CFG and MCFG learning. For an explicit rigid CFG family we compute safe observation size, int…

cs.FL2026

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

Takayuki Kuriyama

Let and fix a morphism into a finite monoid. We study exact factorization and canonical presentation in the relative syntactic congruence $θ_{L,h}:=\eq…

cs.FL2026

Finite-Monoid Compression in Syntactic Concept Lattices: Arity Hierarchies and a Pseudovariety Trichotomy

Takayuki Kuriyama

Clark's syntactic concept lattice (SCL) records two-sided distributional structure, and Wurm extended it to tuples of arbitrary finite arity. We study \(\operatorname{cmp}_f(L)\),…

cs.FL2026

Additive Bases from Primitive Dyck Words: Regular Underapproximations, Motzkin Coding, and Digit Lifting

Takayuki Kuriyama

We study additive representations by integers whose canonical binary expansions are primitive Dyck words. Pairing consecutive bits yields a positional form of the classical relatio…

cs.FL2026

The Value of Finite Observation in Positive-Data Learning of Multiple Context-Free Languages

Takayuki Kuriyama

Positive data can show that two tuple occurrences share a successful sentence context without certifying that they are safely interchangeable. We study finite compositional observa…

cs.FL2014

Distributional Learning of Context-Free Languages under Fixed Finite-Semigroup Typing

Takayuki Kuriyama

We study positive-data learning of context-free languages whose nonempty factors are typed by a fixed morphism into a finite semigroup. A polynomial-time set-driven op…