Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2602.05315 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Reachability and Related Problems in Vector Addition Systems with Nested Zero Tests
by: Guttenberg, Roland, et al.
Published: (2025)
by: Guttenberg, Roland, et al.
Published: (2025)
PVASS Reachability is Decidable
by: Guttenberg, Roland, et al.
Published: (2025)
by: Guttenberg, Roland, et al.
Published: (2025)
On the Counting Complexity of the Skolem Problem
by: Jindal, Gorav, et al.
Published: (2024)
by: Jindal, Gorav, et al.
Published: (2024)
Functions Definable by Numerical Set-Expressions
by: Pratt-Hartmann, Ian, et al.
Published: (2009)
by: Pratt-Hartmann, Ian, et al.
Published: (2009)
Complex Algebras of Arithmetic
by: Düntsch, Ivo, et al.
Published: (2009)
by: Düntsch, Ivo, et al.
Published: (2009)
On the existence of strong proof complexity generators
by: Krajicek, Jan
Published: (2022)
by: Krajicek, Jan
Published: (2022)
Hardness of busy beaver value BB(15)
by: Stérin, Tristan, et al.
Published: (2021)
by: Stérin, Tristan, et al.
Published: (2021)
How to Verify a Turing Machine with Dafny
by: Lederer, Edgar F. A.
Published: (2026)
by: Lederer, Edgar F. A.
Published: (2026)
Finitely Presentable Higher-Dimensional Automata and the Irrationality of Process Replication
by: Basold, Henning, et al.
Published: (2023)
by: Basold, Henning, et al.
Published: (2023)
Reactive Synthesis for Expected Impacts
by: Chini, Emanuele, et al.
Published: (2024)
by: Chini, Emanuele, et al.
Published: (2024)
Turing machines deciders, part I
by: The bbchallenge Collaboration, et al.
Published: (2025)
by: The bbchallenge Collaboration, et al.
Published: (2025)
Axiomatizing NFAs Generated by Regular Grammars
by: Gorrieri, Roberto
Published: (2024)
by: Gorrieri, Roberto
Published: (2024)
Exploring the abyss in Kleene's computability theory
by: Sanders, Sam
Published: (2023)
by: Sanders, Sam
Published: (2023)
On some computational properties of open sets
by: Normann, Dag, et al.
Published: (2024)
by: Normann, Dag, et al.
Published: (2024)
Improving Reachability in Vector Addition Systems through Pumpability
by: Chen, Weijun, et al.
Published: (2026)
by: Chen, Weijun, et al.
Published: (2026)
Neural networks as fuzzy logic formulas
by: Heiman, Damian, et al.
Published: (2026)
by: Heiman, Damian, et al.
Published: (2026)
Place Bisimilarity is Decidable, Indeed!
by: Gorrieri, Roberto
Published: (2021)
by: Gorrieri, Roberto
Published: (2021)
Probabilistic Nets-within-Nets
by: Köhler-Bußmeier, Michael
Published: (2024)
by: Köhler-Bußmeier, Michael
Published: (2024)
On Equivalent Characterizations of NP in Abstract Models of Computation
by: Kirn, Jeremy C., et al.
Published: (2025)
by: Kirn, Jeremy C., et al.
Published: (2025)
A "Symbolic" Representation of Object-Nets (Extended Version)
by: Köhler-Bussmeier, Michael, et al.
Published: (2024)
by: Köhler-Bussmeier, Michael, et al.
Published: (2024)
On the computational properties of basic mathematical notions
by: Normann, Dag, et al.
Published: (2022)
by: Normann, Dag, et al.
Published: (2022)
Probabilistic Shoenfield Machines
by: Bujok, Maksymilian, et al.
Published: (2024)
by: Bujok, Maksymilian, et al.
Published: (2024)
Imperative process algebra and models of computation
by: Middelburg, C. A.
Published: (2022)
by: Middelburg, C. A.
Published: (2022)
The Thins Ordering on Relations
by: Voermans, Ed, et al.
Published: (2024)
by: Voermans, Ed, et al.
Published: (2024)
Edit Distance of Finite-Valued Transducers
by: Mathew, Prince, et al.
Published: (2026)
by: Mathew, Prince, et al.
Published: (2026)
Edit Distance of Finite State Transducers
by: Aiswarya, C., et al.
Published: (2024)
by: Aiswarya, C., et al.
Published: (2024)
Biochemical Computing Mode for Sequential Logic
by: Huang, Han, et al.
Published: (2025)
by: Huang, Han, et al.
Published: (2025)
Satisfiability of Context-free String Constraints with Subword-ordering and Transducers
by: Aiswarya, C, et al.
Published: (2024)
by: Aiswarya, C, et al.
Published: (2024)
Cross-Attention and Encoder-Decoder Transformers: A Logical Characterization
by: Ahvonen, Veeti, et al.
Published: (2026)
by: Ahvonen, Veeti, et al.
Published: (2026)
Weihrauch problems as containers
by: Pradic, Cécilia, et al.
Published: (2025)
by: Pradic, Cécilia, et al.
Published: (2025)
Expressive Power of Graph Transformers via Logic
by: Ahvonen, Veeti, et al.
Published: (2025)
by: Ahvonen, Veeti, et al.
Published: (2025)
Logical Characterizations of Recurrent Graph Neural Networks with Reals and Floats
by: Ahvonen, Veeti, et al.
Published: (2024)
by: Ahvonen, Veeti, et al.
Published: (2024)
Graph neural networks and MSO
by: Ahvonen, Veeti, et al.
Published: (2025)
by: Ahvonen, Veeti, et al.
Published: (2025)
Loops, Inverse Limits and Non-Determinism
by: Brattka, Vasco
Published: (2025)
by: Brattka, Vasco
Published: (2025)
How Concise are Chains of co-Büchi Automata?
by: Ehlers, Rüdiger
Published: (2025)
by: Ehlers, Rüdiger
Published: (2025)
A Decision Procedure for Probabilistic Kleene Algebra with Angelic Nondeterminism
by: Ong, Shawn, et al.
Published: (2025)
by: Ong, Shawn, et al.
Published: (2025)
On the formalization of the notion of an algorithm
by: Middelburg, C. A.
Published: (2024)
by: Middelburg, C. A.
Published: (2024)
Functionals in the Clouds: An abstract architecture of serverless Cloud-Native Apps
by: Ambroszkiewicz, Stanislaw, et al.
Published: (2021)
by: Ambroszkiewicz, Stanislaw, et al.
Published: (2021)
Do not throw out the baby: Clarithmetics as alternatives to weak arithmetics
by: Japaridze, Giorgi
Published: (2026)
by: Japaridze, Giorgi
Published: (2026)
On the formalization of the notion of a concurrent algorithm
by: Middelburg, C. A.
Published: (2024)
by: Middelburg, C. A.
Published: (2024)