:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Leys, Tim, Perez, Guillermo A.
Format:	Preprint
Published:	2024
Subjects:	Formal Languages and Automata Theory
Online Access:	https://arxiv.org/abs/2402.09121
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Learning Realtime One-Counter Automata
by: Bruyère, Véronique, et al.
Published: (2021)

Global One-Counter Tree Automata
by: Herrmann, Luisa, et al.
Published: (2024)

Reachability in VASS Extended with Integer Counters
by: Bizière, Clotilde, et al.
Published: (2026)

Two-Way One-Counter Nets Revisited
by: Almagor, Shaull, et al.
Published: (2024)

Infinite-state Games with Energy Objectives Beyond Counters
by: Sağlam, Irmak, et al.
Published: (2026)

Parameterized Verification of Systems with Precise (0,1)-Counter Abstraction
by: Eichler, Paul, et al.
Published: (2024)

Store Languages of Turing Machines and Counter Machines
by: Friesen, Noah, et al.
Published: (2025)

Localising Stochasticity in Weighted Automata
by: Agarwal, Smayan, et al.
Published: (2026)

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

A Formal Approach for Tuning Stochastic Oscillators
by: Ballarini, Paolo, et al.
Published: (2024)

Notes on Stack Machines and Quantum Stack Machines
by: Qiu, Daowen
Published: (2025)

A Tree Sampler for Bounded Context-Free Languages
by: Considine, Breandan
Published: (2024)

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

Active Inference of Extended Finite State Machine Models with Registers and Guards
by: Groz, Roland, et al.
Published: (2026)

Bounded treewidth, multiple context-free grammars, and downward closures
by: Aiswarya, C., et al.
Published: (2025)

A Complexity Bound for Determinisation of Min-Plus Weighted Automata
by: Almagor, Shaull, et al.
Published: (2026)

Unconditional Time and Space Complexity Lower Bounds for Intersection Non-Emptiness
by: Wehar, Michael
Published: (2025)

Networks of Moore Machines
by: Yodaiken, Victor
Published: (2015)

Black-box Testing Liveness Properties of Partially Observable Stochastic Systems
by: Esparza, Javier, et al.
Published: (2023)

Digital Circuits as Moore Machines
by: Yodaiken, Victor
Published: (2010)

Reasoning about Rare-Event Reachability in Stochastic Vector Addition Systems via Affine Vector Spaces
by: Jeppson, Joshua, et al.
Published: (2025)

General Decidability Results for Systems with Continuous Counters
by: Balasubramanian, A. R., et al.
Published: (2025)

A Characterization of Turing Machines that Compute Primitive Recursive Functions
by: Schwartz, Daniel G.
Published: (2025)

On History-Deterministic One-Counter Nets
by: Prakash, Keya, et al.
Published: (2022)

From LTL to COCOA without Detours
by: Ehlers, Rüdiger, et al.
Published: (2024)

Stochastic Alignments: Matching an Observed Trace to Stochastic Process Models
by: Li, Tian, et al.
Published: (2025)

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

Equivalence of Deterministic Weighted Real-time One-Counter Automata
by: Mathew, Prince, et al.
Published: (2024)

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

Invariants for One-Counter Automata with Disequality Tests
by: Chistikov, Dmitry, et al.
Published: (2024)

From Trees to Tree-Like: Distribution and Synthesis for Asynchronous Automata
by: Lehaut, Mathieu, et al.
Published: (2026)

Transducing Language Models
by: Snæbjarnarson, Vésteinn, et al.
Published: (2026)

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

Alloy-Driven Verification of Object-Centric Event Data: From Temporal Logic to Knowledge Graphs
by: Latif, Saba, et al.
Published: (2025)

Computing the Reachability Value of Posterior-Deterministic POMDPs
by: Fijalkow, Nathanaël, et al.
Published: (2026)

Temporal Causal Models as a Model of Computation
by: Gladyshev, Maksim, et al.
Published: (2026)

A Sharper Upper Bound for the Separating Words Problem
by: Dumitru, Bogdan C.
Published: (2025)

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

Model Checking for Multi-Agent Systems Modeled By Epistemic Process Calculus
by: Yu, Qixian, et al.
Published: (2025)

Polyregular Model Checking
by: Lopez, Aliaume, et al.
Published: (2025)