Cover Image

Program Analysis via Multiple Context Free Language Reachability

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Conrado, Giovanna Kobus, Kjelstrøm, Adam Husted, Pavlogiannis, Andreas, van de Pol, Jaco
Format:	Preprint
Published:	2024
Subjects:	Programming Languages Computational Complexity Formal Languages and Automata Theory D.3.0; F.2.0
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On the Decidability of Verification under Release/Acquire
by: Conrado, Giovanna Kobus, et al.
Published: (2026)

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

On-The-Fly Algorithm for Reachability in Parametric Timed Games (Extended Version)
by: Dahlsen-Jensen, Mikael Bisgaard, et al.
Published: (2024)

Intersection and Union Hierarchies of Deterministic Context-Free Languages and Pumping Lemmas
by: Yamakami, Tomoyuki
Published: (2021)

Some Remarks on Marginal Code Languages
by: Konstantinidis, Stavros
Published: (2026)

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

Asymptotic Hausdorff and Language Similarity
by: Fisman, Dana, et al.
Published: (2026)

Complexity of Unary Exclusive Nondeterministic Finite Automata
by: Kutrib, Martin, et al.
Published: (2024)

Studying homing and synchronizing sequences for Timed Finite State Machines with output delays
by: Vinarskii, Evgenii, et al.
Published: (2025)

Context-Free Recognition with Transformers
by: Jerad, Selim, et al.
Published: (2026)

Between SC and LOGDCFL: Families of Languages Accepted by Logarithmic-Space Deterministic Auxiliary Depth-k Storage Automata
by: Yamakami, Tomoyuki
Published: (2022)

Controller Synthesis for Parametric Timed Games
by: Dahlsen-Jensen, Mikael Bisgaard, et al.
Published: (2025)

Reachability in Geometrically $d$-Dimensional VASS
by: Fu, Yuxi, et al.
Published: (2025)

A Theory of Hanoi Omega-Automata and Games
by: Filiot, Emmanuel, et al.
Published: (2026)

Preprint: Exploring Inevitable Waypoints for Unsolvability Explanation in Hybrid Planning Problems
by: Sarwar, Mir Md Sajid, et al.
Published: (2025)

Proceedings of the 15th International Workshop on Non-Classical Models of Automata and Applications
by: Moreira, Nelma, et al.
Published: (2025)

On the complexity of computing Strahler numbers
by: Ganardi, Moses, et al.
Published: (2025)

Complexity Aspects of the Extension of Wagner's Hierarchy to $k$-Partitions
by: Podolskii, Vladimir, et al.
Published: (2024)

Regular Expressions with Backreferences and Lookaheads Capture NLOG
by: Uezato, Yuya
Published: (2024)

Maximal Length Cellular Automata : A Survey
by: Adak, Sumit, et al.
Published: (2024)

Trading Determinism for Noncommutativity in Edmonds' Problem
by: Arvind, V., et al.
Published: (2024)

Constant-Space, Constant-Randomness Verifiers with Arbitrarily Small Error
by: Gezer, M. Utkan, et al.
Published: (2020)

Visibly Recursive Automata
by: Dubrulle, Kévin, et al.
Published: (2026)

Review of Automaton Learning Algorithms with Polynomial Complexity -- Completely Solved Examples
by: Haneef, Farah
Published: (2024)

Entropy of pebble automata and space complexity
by: Montoya, J. Andres
Published: (2026)

Power of Counting by Nonuniform Families of Polynomial-Size Finite Automata
by: Yamakami, Tomoyuki
Published: (2023)

Proceedings 14th International Workshop on Non-Classical Models of Automata and Applications (NCMA 2024)
by: Manea, Florin, et al.
Published: (2024)

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

Complexity of Fungal Automaton Prediction
by: Formenti, Enrico, et al.
Published: (2026)

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

Nondeterministic Auxiliary Depth-Bounded Storage Automata and Semi-Unbounded Fan-in Cascading Circuits
by: Yamakami, Tomoyuki
Published: (2024)

Rational-Valued Affine Verifiers in Arthur--Merlin Proof Systems
by: Chen, Zeyu, et al.
Published: (2025)

Synthesis of Timeline-Based Planning Strategies Avoiding Determinization
by: Acampora, Renato, et al.
Published: (2024)

Embedding arbitrary Boolean circuits into fungal automata with arbitrary update sequences
by: Goles, Eric, et al.
Published: (2026)

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

Normal Forms for Elements of ${}^*$-Continuous Kleene Algebras Representing the Context-Free Languages
by: Hopkins, Mark, et al.
Published: (2023)

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

Reachability for Multi-Priced Timed Automata with Positive and Negative Rates
by: Scoones, Andrew, et al.
Published: (2024)

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)