arXiv (All)
open access
Distributional Learning of Context-Free Languages under Fixed Finite-Semigroup Typing
We study positive-data learning of context-free languages whose nonempty factors are typed by a fixed morphism $s:Σ^+\to S$ into a finite semigroup. A polynomial-time set-driven operator reconstructs each substitutable target from finite positive witnesses; a separate conservative learner identifies
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Green languages and growth of free inverse monoids#1129845
- Binding On the Fly: Cross-Sentential Anaphora in Variable— Free Semantics#771925
- Minority languages in the linguistic landscape#341351
- Enriched positive logic#1400782
- Neural Language Models Learn the Contextual Distributions of Dependency Structures: a statistical learning theory to compositionality#1129545
Record · ID 1423638
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive