Image de couverture de livre

Detecting and Explaining (In-)equivalence of Context-Free Grammars

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Schmellenkamp, Marko, Zeume, Thomas, Argo, Sven, Kiefer, Sandra, Siems, Cedric, Stebel, Fynn
Format:	Preprint
Publié:	2024
Sujets:	Formal Languages and Automata Theory Computers and Society Programming Languages
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Exploring Error Types in Formal Languages Among Students of Upper Secondary Education
par: Schmellenkamp, Marko, et autres
Publié: (2024)

NILE: Formalizing Natural-Language Descriptions of Formal Languages
par: Kneisel, Tristan, et autres
Publié: (2026)

Difficulty Generating Factors for Context-free Language Construction Assignments
par: Schmalstieg, Florian, et autres
Publié: (2025)

V-Star: Learning Visibly Pushdown Grammars from Program Inputs
par: Jia, Xiaodong, et autres
Publié: (2024)

Forbidden-Context & Ordered Grammar Systems
par: Fernau, Henning, et autres
Publié: (2026)

Polyregular equivalence is undecidable in higher-order types
par: Bojańczyk, Mikołaj, et autres
Publié: (2026)

Constrained Decoding of Diffusion LLMs with Context-Free Grammars
par: Mündler, Niels, et autres
Publié: (2025)

Unraveling Syntax: How Language Models Learn Context-Free Grammars
par: Schulz, Laura Ying, et autres
Publié: (2025)

Passive Model Learning of Visibly Deterministic Context-free Grammars
par: Muškardin, Edi, et autres
Publié: (2025)

A Lower Bound on Unambiguous Context Free Grammars via Communication Complexity
par: Mengel, Stefan, et autres
Publié: (2024)

Directed Regular and Context-Free Languages
par: Ganardi, Moses, et autres
Publié: (2024)

Bonding Grammars
par: Pshenitsyn, Tikhon
Publié: (2024)

Algebraic Characterizations of Classes of Regular Languages in DynFO
par: Barloy, Corentin, et autres
Publié: (2026)

On Decidability and Expressive Power of Fusion Grammars
par: Pshenitsyn, Tikhon
Publié: (2023)

Tahr: The Generative Attribute Grammar Framework
par: Ciccaglione, Matteo, et autres
Publié: (2025)

Computational Model for Parsing Expression Grammars
par: Rubtsov, Alexander, et autres
Publié: (2024)

Efficient Analysis of Unambiguous Automata Using Matrix Semigroup Techniques
par: Kiefer, Stefan, et autres
Publié: (2019)

The complexity of reachability problems in strongly connected finite automata
par: Kiefer, Stefan, et autres
Publié: (2025)

Closure Properties of General Grammars -- Formally Verified
par: Dvorak, Martin, et autres
Publié: (2023)

Idefix-Closed Languages and Their Application in Contextual Grammars
par: Ködding, Marvin, et autres
Publié: (2025)

Modeling and Simulating Agent-Based City Migration Using Conway's Game of Life
par: Deng, Bruce, et autres
Publié: (2024)

Regular Grammars for Sets of Graphs of Tree-Width 2
par: Bozga, Marius, et autres
Publié: (2024)

Characterizing Implementability of Global Protocols with Infinite States and Data
par: Li, Elaine, et autres
Publié: (2024)

Uniform Membership for Hyperedge Replacement Grammars and Related Decision Problems
par: Pshenitsyn, Tikhon
Publié: (2025)

Verifying Parameterized Networks Specified by Vertex-Replacement Graph Grammars
par: Iosif, Radu, et autres
Publié: (2025)

Characterizations of Controlled Generation of Right Linear Grammars with Unknown Behaviors
par: Ise, Daihei, et autres
Publié: (2024)

A Tree Sampler for Bounded Context-Free Languages
par: Considine, Breandan
Publié: (2024)

Shuffles of Context-Free Languages along Regular Trajectories
par: Barloy, Corentin, et autres
Publié: (2026)

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

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

Distributional Learning of Context-Free Languages under Fixed Finite-Monoid Typing
par: Kuriyama, Takayuki
Publié: (2014)

Regular Expressions with Backreferences on Multiple Context-Free Languages, and the Closed-Star Condition
par: Nogami, Taisei, et autres
Publié: (2024)

Regular Grammars as Effective Representations of Recognizable Sets of Series-Parallel Graphs
par: Bozga, Marius, et autres
Publié: (2026)

Abstract String Domain Defined with Word Equations as a Reduced Product (Extended Version)
par: Nepeivoda, Antonina, et autres
Publié: (2025)

Saturating automata for game semantics
par: Dixon, Alex, et autres
Publié: (2023)

Decision Procedure for A Theory of String Sequences
par: Hu, Denghang, et autres
Publié: (2025)

An Automata-theoretic Basis for Specification and Type Checking of Multiparty Protocols
par: Stutz, Felix, et autres
Publié: (2025)

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

Maximal and minimal dynamic Petri net slicing
par: Llorens, Marisa, et autres
Publié: (2021)

CIR+CVN: Bridging LLM Semantic Understanding and Petri-Net Verification for Concurrent Programs
par: Zhang, Kaiwen, et autres
Publié: (2026)