Saved in:
| Main Author: | Shen, Alexander |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2403.01534 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Bishop's (up)crossing inequality and lower semicomputable random reals revisited
by: Andreev, Mikhail, et al.
Published: (2025)
by: Andreev, Mikhail, et al.
Published: (2025)
Deterministic Suffix-reading Automata
by: Keerthan, R, et al.
Published: (2025)
by: Keerthan, R, et al.
Published: (2025)
List of Results on the Černý Conjecture and Reset Thresholds for Synchronizing Automata
by: Volkov, Mikhail V.
Published: (2025)
by: Volkov, Mikhail V.
Published: (2025)
Input-Erasing Two-Way Finite Automata
by: Meduna, Alexander, et al.
Published: (2025)
by: Meduna, Alexander, et al.
Published: (2025)
On Transition Constructions for Automata -- A Categorical Perspective
by: Cruchten, Mike
Published: (2024)
by: Cruchten, Mike
Published: (2024)
Kleene Theorems for Lasso Languages and $ω$-Languages
by: Cruchten, Mike
Published: (2024)
by: Cruchten, Mike
Published: (2024)
Polynomial Complementation of Nondeterministic 2-Way Finite Automata by 1-Limited Automata
by: Guillon, Bruno, et al.
Published: (2025)
by: Guillon, Bruno, et al.
Published: (2025)
Propositional dynamic logic and asynchronous cascade decompositions for regular trace languages
by: Adsul, Bharat, et al.
Published: (2024)
by: Adsul, Bharat, et al.
Published: (2024)
Axiomatizing NFAs Generated by Regular Grammars
by: Gorrieri, Roberto
Published: (2024)
by: Gorrieri, Roberto
Published: (2024)
The Algebra of Nondeterministic Finite Automata
by: Gorrieri, Roberto
Published: (2023)
by: Gorrieri, Roberto
Published: (2023)
Functional Closure Properties of Finite $\mathbb{N}$-weighted Automata
by: Dörfler, Julian, et al.
Published: (2024)
by: Dörfler, Julian, et al.
Published: (2024)
Computing the Bandwidth of Meager Timed Automata
by: Asarin, Eugene, et al.
Published: (2024)
by: Asarin, Eugene, et al.
Published: (2024)
Weighing Obese Timed Languages
by: Asarin, Eugene, et al.
Published: (2025)
by: Asarin, Eugene, et al.
Published: (2025)
Decidability of membership problems for flat rational subsets of $\mathrm{GL}(2,\mathbb{Q})$ and singular matrices
by: Diekert, Volker, et al.
Published: (2019)
by: Diekert, Volker, et al.
Published: (2019)
All Kolmogorov complexity functions are optimal, but are some more optimal?
by: Bauwens, Bruno, et al.
Published: (2025)
by: Bauwens, Bruno, et al.
Published: (2025)
Classically Time-Controlled Quantum Automata: Definition and Properties
by: Díaz-Caro, Alejandro, et al.
Published: (2018)
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)
by: Jillson, Noah, et al.
Published: (2024)
$\mathbb{N}$-polyregular functions arise from well-quasi-orderings
by: Lopez, Aliaume
Published: (2024)
by: Lopez, Aliaume
Published: (2024)
Hexagonal Picture Scanning Automata
by: D, Deepalakshmi, et al.
Published: (2025)
by: D, Deepalakshmi, et al.
Published: (2025)
Product gales and Finite state dimension
by: S, Akhil
Published: (2025)
by: S, Akhil
Published: (2025)
Commutative N-polyregular functions
by: Lopez, Aliaume
Published: (2024)
by: Lopez, Aliaume
Published: (2024)
Regular Model Checking for Systems with Effectively Regular Reachability Relation
by: Esparza, Javier, et al.
Published: (2025)
by: Esparza, Javier, et al.
Published: (2025)
Binarized Neural Networks Converge Toward Algorithmic Simplicity: Empirical Support for the Learning-as-Compression Hypothesis
by: Sakabe, Eduardo Y., et al.
Published: (2025)
by: Sakabe, Eduardo Y., et al.
Published: (2025)
Evolution-Based Timed Opacity under a Universal Observation Model
by: Zhang, Zhe, et al.
Published: (2026)
by: Zhang, Zhe, et al.
Published: (2026)
On Graph Grammars and Games
by: Vijayakumar, Jayakrishna, et al.
Published: (2024)
by: Vijayakumar, Jayakrishna, et al.
Published: (2024)
Greedy Poisson Rejection Sampling
by: Flamich, Gergely
Published: (2023)
by: Flamich, Gergely
Published: (2023)
A Formalization of Co-Transcriptional Splicing as an Operation on Formal Languages
by: Cho, Da-Jung, et al.
Published: (2025)
by: Cho, Da-Jung, et al.
Published: (2025)
Hypernode Automata
by: Bartocci, Ezio, et al.
Published: (2023)
by: Bartocci, Ezio, et al.
Published: (2023)
Formal Foundations for Controlled Stochastic Activity Networks
by: Movaghar, Ali
Published: (2025)
by: Movaghar, Ali
Published: (2025)
Kolmogorov complexity as a combinatorial tool
by: Shen, Alexander
Published: (2024)
by: Shen, Alexander
Published: (2024)
Evaluating Massively Parallel Algorithms for DFA Minimisation, Equivalence Checking and Inclusion Checking
by: Heemstra, Jan, et al.
Published: (2025)
by: Heemstra, Jan, et al.
Published: (2025)
Shifting Zeckendorf and Chung-Graham representations
by: Burns, Rob
Published: (2025)
by: Burns, Rob
Published: (2025)
Subshifts defined by nondeterministic and alternating plane-walking automata
by: de Menibus, Benjamin Hellouin, et al.
Published: (2024)
by: de Menibus, Benjamin Hellouin, et al.
Published: (2024)
Decision Problems on Copying and Shuffling
by: Halava, Vesa, et al.
Published: (2023)
by: Halava, Vesa, et al.
Published: (2023)
E-variables and tests of randomness for distribution classes
by: Potapov, Georgii, et al.
Published: (2026)
by: Potapov, Georgii, et al.
Published: (2026)
Adaptive Greedy Rejection Sampling
by: Flamich, Gergely, et al.
Published: (2023)
by: Flamich, Gergely, et al.
Published: (2023)
Attention Meets Reachability: Structural Equivalence and Efficiency in Grammar-Constrained LLM Decoding
by: Alpay, Faruk, et al.
Published: (2026)
by: Alpay, Faruk, et al.
Published: (2026)
Normal forms in Virus Machines
by: Ramírez-de-Arellano, A., et al.
Published: (2024)
by: Ramírez-de-Arellano, A., et al.
Published: (2024)
Learning Closed Signal Flow Graphs
by: Piotrovskaya, Ekaterina, et al.
Published: (2024)
by: Piotrovskaya, Ekaterina, et al.
Published: (2024)
Implementing Basic Arithmetic in $\mathbb{F}_p$ via $\mathbb{F}_2$, and Its Application for Computing the Hamming Distance of Linear Codes
by: Hernando, Fernando, et al.
Published: (2026)
by: Hernando, Fernando, et al.
Published: (2026)
Similar Items
-
Bishop's (up)crossing inequality and lower semicomputable random reals revisited
by: Andreev, Mikhail, et al.
Published: (2025) -
Deterministic Suffix-reading Automata
by: Keerthan, R, et al.
Published: (2025) -
List of Results on the Černý Conjecture and Reset Thresholds for Synchronizing Automata
by: Volkov, Mikhail V.
Published: (2025) -
Input-Erasing Two-Way Finite Automata
by: Meduna, Alexander, et al.
Published: (2025) -
On Transition Constructions for Automata -- A Categorical Perspective
by: Cruchten, Mike
Published: (2024)