Image de couverture de livre

A Uniform Framework for Problems on Context-Free Grammars

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Esparza, Javier, Rossmanith, Peter, Schwoon, Stefan
Format:	Preprint
Publié:	2024
Sujets:	Formal Languages and Automata Theory F.4.2; F.1.1
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Identity Testing for Stochastic Languages
par: Agarwal, Smayan, et autres
Publié: (2025)

Turn Complexity of Context-free Languages, Pushdown Automata and One-Counter Automata
par: Pighizzini, Giovanni
Publié: (2026)

Parsing Hypergraphs using Context-Free Positional Grammars
par: Costagliola, Gennaro, et autres
Publié: (2026)

On some Classes of Reversible 2-head Automata
par: Nagy, Benedek, et autres
Publié: (2025)

Various Types of Comet Languages and their Application in External Contextual Grammars
par: Ködding, Marvin, et autres
Publié: (2024)

Geometric Characterization of Context-Free Intersections via the Inner Segment Dichotomy
par: Silva, Jorge Miguel
Publié: (2026)

Techniques for Showing the Decidability of the Boundedness Problem of Language Acceptors
par: Ibarra, Oscar H., et autres
Publié: (2024)

Intrinsic Verification of Parsers and Formal Grammar Theory in Dependent Lambek Calculus (Extended Version)
par: Schaefer, Steven, et autres
Publié: (2025)

On the Boolean Closure of Deterministic Top-Down Tree Automata
par: Löding, Christof, et autres
Publié: (2024)

Probabilistic Finite Automaton Emptiness is undecidable
par: Rote, Günter
Publié: (2024)

Probabilistic Finite Automaton Emptiness is Undecidable for a Fixed Automaton
par: Rote, Günter
Publié: (2024)

On Repetitive Finite Automata with Translucent Words
par: Mráz, František, et autres
Publié: (2025)

On Minimization and Learning of Deterministic $ω$-Automata in the Presence of Don't Care Words
par: Löding, Christof, et autres
Publié: (2022)

Recognizing Numbers
par: Gaba, Pranshu, et autres
Publié: (2025)

Lexicographic transductions of finite words
par: Filiot, Emmanuel, et autres
Publié: (2025)

Orbit-Finite-Dimensional Vector Spaces and Weighted Register Automata
par: Bojańczyk, Mikołaj, et autres
Publié: (2021)

On Graph Grammars and Games
par: Vijayakumar, Jayakrishna, et autres
Publié: (2024)

Decidability Issues for Petri Nets -- a survey
par: Esparza, Javier, et autres
Publié: (2024)

A New Graph Grammar Formalism for Robust Syntactic Pattern Recognition
par: Fletcher, Peter
Publié: (2025)

Attractor Basins in Concurrent Systems
par: Samboni, Giann Karlo Aguirre, et autres
Publié: (2024)

Around Context-Free Grammars -- a Normal Form, a Representation Theorem, and a Regular Approximation
par: Cojocaru, Liliana
Publié: (2015)

Deterministic Suffix-reading Automata
par: Keerthan, R, et autres
Publié: (2024)

Separability in Büchi Vass and Singly Non-Linear Systems of Inequalities
par: Baumann, Pascal, et autres
Publié: (2024)

Reachability for Multi-Priced Timed Automata with Positive and Negative Rates
par: Scoones, Andrew, et autres
Publié: (2024)

Equivalence of Deterministic Weighted Real-time One-Counter Automata
par: Mathew, Prince, et autres
Publié: (2024)

Flattability of Priority Vector Addition Systems
par: Guttenberg, Roland
Publié: (2024)

Checking Timed Bisimilarity with Virtual Clocks
par: Lieb, Alexander, et autres
Publié: (2024)

Exploring VASS Parameterised by Geometric Dimension
par: Czerwiński, Wojciech, et autres
Publié: (2026)

On Constructing Finite Automata by Relational Programming
par: Egri-Nagy, Attila, et autres
Publié: (2025)

Anti-Context-Free languages
par: Cardó, Carles
Publié: (2024)

Implementation of Polynomial NP-Complete Algorithms Based on the NP Verifier Simulation Framework
par: Lee, Changryeol
Publié: (2026)

Exploring Complexity: An Extended Study of Formal Properties for Process Model Complexity Measures
par: Schalk, Patrizia, et autres
Publié: (2024)

The Inclusion Depth of Pattern Languages: An Open Problem in Algorithmic Learning Theory
par: Luo, Wei
Publié: (2026)

Satisfiability of Context-free String Constraints with Subword-ordering and Transducers
par: Aiswarya, C, et autres
Publié: (2024)

Inversion by Partial Evaluation: A Reversible Interpreter Experiment
par: Glück, Robert, et autres
Publié: (2024)

Regular Model Checking for Systems with Effectively Regular Reachability Relation
par: Esparza, Javier, et autres
Publié: (2025)

Construction of Minkowski Sums by Cellular Automata
par: Tahay, Pierre-Adrien
Publié: (2024)

Learning Tree Automata with Term Rewriting
par: Kopystiański, Jakub, et autres
Publié: (2026)

A Nivat Theorem for Weighted Alternating Automata over Commutative Semirings
par: Grabolle, Gustav
Publié: (2022)

On Transition Constructions for Automata -- A Categorical Perspective
par: Cruchten, Mike
Publié: (2024)