:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Andreev, Mikhail, Shen, Alexander
Format:	Preprint
Published:	2025
Subjects:	Logic Information Theory 68Q45 F.1.1
Online Access:	https://arxiv.org/abs/2511.09756
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Conditional normality and finite-state dimensions revisited
by: Shen, Alexander
Published: (2024)

Commutative N-polyregular functions
by: Lopez, Aliaume
Published: (2024)

The Algebra of Nondeterministic Finite Automata
by: Gorrieri, Roberto
Published: (2023)

Axiomatizing NFAs Generated by Regular Grammars
by: Gorrieri, Roberto
Published: (2024)

Propositional dynamic logic and asynchronous cascade decompositions for regular trace languages
by: Adsul, Bharat, et al.
Published: (2024)

List of Results on the Černý Conjecture and Reset Thresholds for Synchronizing Automata
by: Volkov, Mikhail V.
Published: (2025)

Learning Closed Signal Flow Graphs
by: Piotrovskaya, Ekaterina, et al.
Published: (2024)

Deterministic Suffix-reading Automata
by: Keerthan, R, et al.
Published: (2025)

Input-Erasing Two-Way Finite Automata
by: Meduna, Alexander, et al.
Published: (2025)

Current-State Opacity in Safe Partially Observed Quantum Petri Nets: True-Concurrency Semantics and Exact Symbolic Verification
by: Ding, Sichen, et al.
Published: (2026)

Monitoring Hyperproperties over Observed and Constructed Traces
by: Chalupa, Marek, et al.
Published: (2025)

Determination of the fifth Busy Beaver value
by: The bbchallenge Collaboration, et al.
Published: (2025)

Formal Foundations for Controlled Stochastic Activity Networks
by: Movaghar, Ali
Published: (2025)

On Equivalent Characterizations of NP in Abstract Models of Computation
by: Kirn, Jeremy C., et al.
Published: (2025)

Place Bisimilarity is Decidable, Indeed!
by: Gorrieri, Roberto
Published: (2021)

Probabilistic Nets-within-Nets
by: Köhler-Bußmeier, Michael
Published: (2024)

A "Symbolic" Representation of Object-Nets (Extended Version)
by: Köhler-Bussmeier, Michael, et al.
Published: (2024)

Polynomial Complementation of Nondeterministic 2-Way Finite Automata by 1-Limited Automata
by: Guillon, Bruno, et al.
Published: (2025)

On Transition Constructions for Automata -- A Categorical Perspective
by: Cruchten, Mike
Published: (2024)

Kleene Theorems for Lasso Languages and $ω$-Languages
by: Cruchten, Mike
Published: (2024)

On the existence of strong proof complexity generators
by: Krajicek, Jan
Published: (2022)

E-variables and tests of randomness for distribution classes
by: Potapov, Georgii, et al.
Published: (2026)

Weighing Obese Timed Languages
by: Asarin, Eugene, et al.
Published: (2025)

Computing the Bandwidth of Meager Timed Automata
by: Asarin, Eugene, et al.
Published: (2024)

A Logspace Constructive Proof of L=SL
by: Buss, Sam, et al.
Published: (2025)

Functional Closure Properties of Finite $\mathbb{N}$-weighted Automata
by: Dörfler, Julian, et al.
Published: (2024)

Decidability of membership problems for flat rational subsets of $\mathrm{GL}(2,\mathbb{Q})$ and singular matrices
by: Diekert, Volker, et al.
Published: (2019)

Classically Time-Controlled Quantum Automata: Definition and Properties
by: Díaz-Caro, Alejandro, et al.
Published: (2018)

Finite-State Machines for Horospheres in Hyperbolic Right-Angled Coxeter Groups
by: Jillson, Noah, et al.
Published: (2024)

Psi-Turing Machines: Bounded Introspection for Complexity Barriers and Oracle Separations
by: Huseynzade, Rafig
Published: (2025)

An MDL-Style Cost Functional KC, Distribution-Preserving Reductions ($A2^d$), and an $AC^0$+log Lower Bound for 3SAT via Balanced 3XOR
by: Lela, Marko
Published: (2025)

Reversible computations are computations
by: Aubert, Clément, et al.
Published: (2025)

A declarative approach to specifying distributed algorithms using three-valued modal logic
by: Gabbay, Murdoch J., et al.
Published: (2025)

All Kolmogorov complexity functions are optimal, but are some more optimal?
by: Bauwens, Bruno, et al.
Published: (2025)

$\mathbb{N}$-polyregular functions arise from well-quasi-orderings
by: Lopez, Aliaume
Published: (2024)

Extended Nullstellensatz proof systems
by: Krajicek, Jan
Published: (2023)

Insignificant Choice Polynomial Time: A Logic Capturing PTIME
by: Schewe, Klaus-Dieter
Published: (2020)

Decidable Reversible Equivalences for Finite Petri Nets
by: Gorrieri, Roberto, et al.
Published: (2025)

Hexagonal Picture Scanning Automata
by: D, Deepalakshmi, et al.
Published: (2025)

Regular Model Checking for Systems with Effectively Regular Reachability Relation
by: Esparza, Javier, et al.
Published: (2025)