:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autores principales:	Jia, Xiaodong, Tan, Gang
Formato:	Preprint
Publicado:	2024
Materias:	Programming Languages Formal Languages and Automata Theory
Acceso en línea:	https://arxiv.org/abs/2404.04201
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Input-Driven Pushdown Automata with Translucent Input Letters
por: Kutrib, Martin, et al.
Publicado: (2025)

Visibly Pushdown Languages in Groups
por: Ciobanu, Laura, et al.
Publicado: (2026)

Reachability in Trace-Pushdown Systems
por: Köcher, Chris, et al.
Publicado: (2025)

Explorability in Pushdown Automata
por: Bedi, Ayaan, et al.
Publicado: (2025)

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

Reachability in One-Dimensional Pushdown Vector Addition Systems is Decidable
por: Bizière, Clotilde, et al.
Publicado: (2024)

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

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

Bonding Grammars
por: Pshenitsyn, Tikhon
Publicado: (2024)

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

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

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

A Synthesis Method of Safe Rust Code Based on Pushdown Colored Petri Nets
por: Zhang, Kaiwen, et al.
Publicado: (2026)

Visual Execution and Validation of Finite-State Machines and Pushdown Automata
por: Morazán, Marco T., et al.
Publicado: (2025)

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

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

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

Computational Model for Parsing Expression Grammars
por: Rubtsov, Alexander, et al.
Publicado: (2024)

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

On Decidability and Expressive Power of Fusion Grammars
por: Pshenitsyn, Tikhon
Publicado: (2023)

Tahr: The Generative Attribute Grammar Framework
por: Ciccaglione, Matteo, et al.
Publicado: (2025)

The No Endmarker Theorem for One-Way Probabilistic Pushdown Automata
por: Yamakami, Tomoyuki
Publicado: (2021)

The $\mathsf{AC}^0$-Complexity Of Visibly Pushdown Languages
por: Göller, Stefan, et al.
Publicado: (2023)

Closure Properties of General Grammars -- Formally Verified
por: Dvorak, Martin, et al.
Publicado: (2023)

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

Regular Grammars for Sets of Graphs of Tree-Width 2
por: Bozga, Marius, et al.
Publicado: (2024)

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

Characterizations of Controlled Generation of Right Linear Grammars with Unknown Behaviors
por: Ise, Daihei, et al.
Publicado: (2024)

Uniform Membership for Hyperedge Replacement Grammars and Related Decision Problems
por: Pshenitsyn, Tikhon
Publicado: (2025)

Verifying Parameterized Networks Specified by Vertex-Replacement Graph Grammars
por: Iosif, Radu, et al.
Publicado: (2025)

Continuous Pushdown VASS in One Dimension are Easy
por: Perez, Guillermo A., et al.
Publicado: (2024)

SynCode: LLM Generation with Grammar Augmentation
por: Ugare, Shubham, et al.
Publicado: (2024)

Automating the Analysis and Improvement of Dynamic Programming Algorithms with Applications to Natural Language Processing
por: Vieira, Tim
Publicado: (2026)

Unambiguous and Co-Nondeterministic Computations of Finite Automata and Pushdown Automata Families and the Effects of Multiple Counters
por: Yamakami, Tomoyuki
Publicado: (2024)

Constrained Decoding of Diffusion LLMs with Context-Free Grammars
por: Mündler, Niels, et al.
Publicado: (2025)

A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct
por: Guha, Shibashis, et al.
Publicado: (2021)

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

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

Synchronisability in Mailbox Communication
por: Di Giusto, Cinzia, et al.
Publicado: (2024)

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