Cover Image

Automating the Analysis and Improvement of Dynamic Programming Algorithms with Applications to Natural Language Processing

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Vieira, Tim
Format:	Preprint
Published:	2026
Subjects:	Programming Languages Computation and Language Formal Languages and Automata Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Transducing Language Models
by: Snæbjarnarson, Vésteinn, et al.
Published: (2026)

Automated Formalization of Probabilistic Requirements from Structured Natural Language
by: Mavridou, Anastasia, et al.
Published: (2025)

Refuting Equivalence in Probabilistic Programs with Conditioning
by: Chatterjee, Krishnendu, et al.
Published: (2025)

Equivalence and Similarity Refutation for Probabilistic Programs
by: Chatterjee, Krishnendu, et al.
Published: (2024)

Weighted Automata for Exact Inference in Discrete Probabilistic Programs
by: Geißler, Dominik, et al.
Published: (2025)

V-Star: Learning Visibly Pushdown Grammars from Program Inputs
by: Jia, Xiaodong, et al.
Published: (2024)

Type-Driven Prompt Programming: From Typed Interfaces to a Calculus of Constraints
by: Paul, Abhijit
Published: (2025)

Probabilistic Programming Meets Automata Theory: Exact Inference using Weighted Automata
by: Geißler, Dominik, et al.
Published: (2025)

CIR+CVN: Bridging LLM Semantic Understanding and Petri-Net Verification for Concurrent Programs
by: Zhang, Kaiwen, et al.
Published: (2026)

Syntax Repair as Language Intersection
by: Considine, Breandan
Published: (2025)

Prefix Parsing is Just Parsing
by: Pasti, Clemente, et al.
Published: (2026)

A Bionic Natural Language Parser Equivalent to a Pushdown Automaton
by: Wei, Zhenghao, et al.
Published: (2024)

Duality-based Mode Operations and Pyramid Multilayer Mapping for Rhetorical Modes
by: Wu, Zi-Niu
Published: (2025)

Benchmarking Testing in Automated Theorem Proving
by: Kim, Jongyoon, et al.
Published: (2026)

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

Polyregular equivalence is undecidable in higher-order types
by: Bojańczyk, Mikołaj, et al.
Published: (2026)

Abstract String Domain Defined with Word Equations as a Reduced Product (Extended Version)
by: Nepeivoda, Antonina, et al.
Published: (2025)

Characterizing Implementability of Global Protocols with Infinite States and Data
by: Li, Elaine, et al.
Published: (2024)

Saturating automata for game semantics
by: Dixon, Alex, et al.
Published: (2023)

Decision Procedure for A Theory of String Sequences
by: Hu, Denghang, et al.
Published: (2025)

An Automata-theoretic Basis for Specification and Type Checking of Multiparty Protocols
by: Stutz, Felix, et al.
Published: (2025)

Maximal and minimal dynamic Petri net slicing
by: Llorens, Marisa, et al.
Published: (2021)

Synthesizing DSLs for Few-Shot Learning
by: Krogmeier, Paul, et al.
Published: (2025)

Reactive graphs in action (extended version)
by: Tinoco, David, et al.
Published: (2024)

Synchronisability in Mailbox Communication
by: Di Giusto, Cinzia, et al.
Published: (2024)

Verification under TSO with an infinite Data Domain
by: Abdulla, Parosh Aziz, et al.
Published: (2024)

Linear Matching of JavaScript Regular Expressions
by: Barrière, Aurèle, et al.
Published: (2023)

Formally Verified Linear-Time Invertible Lexing
by: Chassot, Samuel, et al.
Published: (2025)

Finding Regular Herbrand Models for CHCs using Answer Set Programming
by: Maire, Gregoire, et al.
Published: (2025)

A Diagrammatic Axiomatisation of Behavioural Distance of Nondeterministic Processes
by: Różowski, Wojciech, et al.
Published: (2026)

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

Detecting and Explaining (In-)equivalence of Context-Free Grammars
by: Schmellenkamp, Marko, et al.
Published: (2024)

On the Representational Capacity of Neural Language Models with Chain-of-Thought Reasoning
by: Nowak, Franz, et al.
Published: (2024)

Productive Quantum Programming Needs Better Abstract Machines
by: Núñez-Corrales, Santiago, et al.
Published: (2025)

Comparing Spoken Languages using Paninian System of Sounds and Finite State Machines
by: Prabhu, Shreekanth M, et al.
Published: (2023)

Bridging the Empirical-Theoretical Gap in Neural Network Formal Language Learning Using Minimum Description Length
by: Lan, Nur, et al.
Published: (2024)

Idefix-Closed Languages and Their Application in Contextual Grammars
by: Ködding, Marvin, et al.
Published: (2025)

Petri Nets-based Methods on Automatically Detecting for Concurrency Bugs in Rust Programs
by: Zhang, Kaiwen, et al.
Published: (2022)

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

Semiflows, Home Spaces, and Home States, Applications to the Analysis of Parameterized Petri Nets
by: Memmi, Gerard
Published: (2025)