Cover Image

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

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Kuriyama, Takayuki
Format:	Preprint
Published:	2014
Subjects:	Formal Languages and Automata Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Finite Sentence-Interface Control for Learning Bounded-Fan-Out Linear MCFGs under Fixed Monoid Typing
by: Kuriyama, Takayuki
Published: (2026)

Reversible Weighted Automata over Finite Rings and Monoids with Commuting Idempotents
by: Kostolányi, Peter, et al.
Published: (2026)

Distributional Learning of Graph Languages Generated by Fixed-Interface Clause Systems
by: Shoudai, Takayoshi, et al.
Published: (2026)

Active Learning of Deterministic Transducers with Outputs in Arbitrary Monoids
by: Aristote, Quentin
Published: (2024)

Extended Stone Duality via Monoidal Adjunctions
by: Lenke, Fabian, et al.
Published: (2024)

A Tree Sampler for Bounded Context-Free Languages
by: Considine, Breandan
Published: (2024)

Shuffles of Context-Free Languages along Regular Trajectories
by: Barloy, Corentin, et al.
Published: (2026)

Regular Expressions with Backreferences on Multiple Context-Free Languages, and the Closed-Star Condition
by: Nogami, Taisei, et al.
Published: (2024)

Directed Regular and Context-Free Languages
by: Ganardi, Moses, et al.
Published: (2024)

Context-Free Languages of String Diagrams
by: Earnshaw, Matt, et al.
Published: (2024)

Measure-Theoretic Aspects of Star-Free and Group Languages
by: Sin'ya, Ryoma, et al.
Published: (2025)

Passive Model Learning of Visibly Deterministic Context-free Grammars
by: Muškardin, Edi, et al.
Published: (2025)

Approximate Problems for Finite Transducers
by: Filiot, Emmanuel, et al.
Published: (2025)

Distribution of Reconfiguration Languages maintaining Tree-like Communication Topology
by: Hausmann, Daniel, et al.
Published: (2024)

Finite Automata for Efficient Graph Recognition
by: Drewes, Frank, et al.
Published: (2024)

Finite-valued Streaming String Transducers
by: Filiot, Emmanuel, et al.
Published: (2024)

Repetitive Finite Automata With Translucent Letters
by: Mráz, František, et al.
Published: (2024)

Finite maximal codes and factorizations of cyclic groups
by: De Felice, Clelia
Published: (2022)

Descriptional Complexity of Finite Automata -- Selected Highlights
by: Salomaa, Arto, et al.
Published: (2023)

Measure Many Quantum Finite Automata on Infinite Words
by: Midya, Abhisek, et al.
Published: (2026)

Fast and General Automatic Differentiation for Finite-State Methods
by: Yang, Lucas Ondel, et al.
Published: (2026)

Efficient Constructions of Finite-State Independent Normal Pairs
by: Pulari, Subin
Published: (2026)

Weighted Context-Free-Language Ordered Binary Decision Diagrams
by: Sistla, Meghana, et al.
Published: (2023)

Certified Symbolic Finite Transducers: Formalization and Applications to String Analysis
by: Kan, Shuanglong, et al.
Published: (2025)

Optimal Approximate Minimization of One-Letter Weighted Finite Automata
by: Lacroce, Clara, et al.
Published: (2023)

Forbidden-Context & Ordered Grammar Systems
by: Fernau, Henning, et al.
Published: (2026)

Mata, a Fast and Simple Finite Automata Library (Technical Report)
by: Chocholatý, David, et al.
Published: (2023)

Active Inference of Extended Finite State Machine Models with Registers and Guards
by: Groz, Roland, et al.
Published: (2026)

Realisability and Complementability of Multiparty Session Types
by: Di Giusto, Cinzia, et al.
Published: (2025)

Intersection and Union Hierarchies of Deterministic Context-Free Languages and Pumping Lemmas
by: Yamakami, Tomoyuki
Published: (2021)

A Lower Bound on Unambiguous Context Free Grammars via Communication Complexity
by: Mengel, Stefan, et al.
Published: (2024)

The Quadratic State Cost of Classical Simulation of One-Way Quantum Finite Automata
by: Chen, Zeyu, et al.
Published: (2026)

Greybox Learning of Languages Recognizable by Event-Recording Automata
by: Majumdar, Anirban, et al.
Published: (2024)

Generalised Arc Consistency via the Synchronised Product of Finite Automata wrt a Constraint
by: Beldiceanu, Nicolas
Published: (2025)

GrappaRE -- A Tool for Efficient Graph Recognition Based on Finite Automata and Regular Expressions
by: De Rosa, Mattia, et al.
Published: (2025)

Well-Formed Free-Choice Petri Nets Revisited
by: Jancar, Petr, et al.
Published: (2026)

Unraveling Syntax: How Language Models Learn Context-Free Grammars
by: Schulz, Laura Ying, et al.
Published: (2025)

Global Protocols under Rendezvous Synchrony: From Realizability to Type Checking
by: Li, Elaine, et al.
Published: (2026)

Static Analysis Framework for Detecting Use-After-Free Bugs in C++
by: Teodorescu, Vlad-Alexandru, et al.
Published: (2024)

Undecidability of the Emptiness Problem for Weak Models of Distributed Computing
by: Principato, Flavio T., et al.
Published: (2025)