:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autores principales:	Leys, Tim, Perez, Guillermo A.
Formato:	Preprint
Publicado:	2024
Materias:	Formal Languages and Automata Theory
Acceso en línea:	https://arxiv.org/abs/2402.09121
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

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

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

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

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

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

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

Localising Stochasticity in Weighted Automata
por: Agarwal, Smayan, et al.
Publicado: (2026)

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

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

Notes on Stack Machines and Quantum Stack Machines
por: Qiu, Daowen
Publicado: (2025)

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

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

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

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

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

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

Networks of Moore Machines
por: Yodaiken, Victor
Publicado: (2015)

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

Digital Circuits as Moore Machines
por: Yodaiken, Victor
Publicado: (2010)

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

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

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

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

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

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

Visibly Recursive Automata
por: Dubrulle, Kévin, et al.
Publicado: (2026)

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

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

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

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

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

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

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

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

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

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

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

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

Polyregular Model Checking
por: Lopez, Aliaume, et al.
Publicado: (2025)