Cover Image

Idefix-Closed Languages and Their Application in Contextual Grammars

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Ködding, Marvin, Truthe, Bianca
Format:	Preprint
Published:	2025
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

Various Types of Comet Languages and their Application in External Contextual Grammars
by: Ködding, Marvin, et al.
Published: (2024)

Bonding Grammars
by: Pshenitsyn, Tikhon
Published: (2024)

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

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

On Decidability and Expressive Power of Fusion Grammars
by: Pshenitsyn, Tikhon
Published: (2023)

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

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

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

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

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

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

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

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

A Close Analysis of the Subset Construction
by: Baburin, Ivan, et al.
Published: (2024)

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

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

A Language and Methodology based on Scenarios, Grammars and Views, for Administrative Business Processes Modelling
by: Ndadji, Milliam Maxime Zekeng, et al.
Published: (2020)

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

Universally Wheeler Languages
by: Becker, Ruben, et al.
Published: (2025)

Quantitative Language Automata
by: Henzinger, Thomas A., et al.
Published: (2025)

Regular Grammars as Effective Representations of Recognizable Sets of Series-Parallel Graphs
by: Bozga, Marius, et al.
Published: (2026)

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

Positive Varieties of Lattice Languages
by: Inoue, Yusuke, et al.
Published: (2025)

On the Complexity of Language Membership for Probabilistic Words
by: Amarilli, Antoine, et al.
Published: (2025)

Stochastic Languages at Sub-stochastic Cost
by: Agarwal, Smayan, et al.
Published: (2025)

On the Separability Problem of VASS Reachability Languages
by: Keskin, Eren, et al.
Published: (2024)

Operational State Complexity of Block Languages
by: Duarte, Guilherme, et al.
Published: (2024)

On the Representation and State Complexity of Block Languages
by: Duarte, Guilherme, et al.
Published: (2024)

Regular Languages in the Sliding Window Model
by: Ganardi, Moses, et al.
Published: (2024)

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

Positive Characteristic Sets for Relational Pattern Languages
by: Mousawi, S. Mahmoud, et al.
Published: (2025)

Tree-Verifiable Graph Grammars
by: Chimes, Mark, et al.
Published: (2024)

Languages of Boundedly-Ambiguous Vector Addition Systems with States
by: Czerwiński, Wojciech, et al.
Published: (2025)

Atomic Gliders and CA as Language Generators (Extended Version)
by: Fisman, Dana, et al.
Published: (2025)

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

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)

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

Kamp Theorem for Pomset Languages of Higher Dimensional Automata
by: Clement, Emily, et al.
Published: (2024)

Some Remarks on First-Order Definable Tree Languages
by: Blumensath, Achim
Published: (2024)