List of Results on the Černý Conjecture and Reset Thresholds for Synchronizing Automata
Fuente:
arXiv
Saved in:
| Main Author: | Volkov, Mikhail V. |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Deterministic Suffix-reading Automata
by: Keerthan, R, et al.
Published: (2025)
by: Keerthan, R, et al.
Published: (2025)
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)
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)
Hypernode Automata
by: Bartocci, Ezio, et al.
Published: (2023)
by: Bartocci, Ezio, et al.
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)
The Algebra of Nondeterministic Finite Automata
by: Gorrieri, Roberto
Published: (2023)
by: Gorrieri, Roberto
Published: (2023)
Kleene Theorems for Lasso Languages and $ω$-Languages
by: Cruchten, Mike
Published: (2024)
by: Cruchten, Mike
Published: (2024)
Don's conjecture for binary completely reachable automata: an approach and its limitations
by: Casas, David, et al.
Published: (2023)
by: Casas, David, et al.
Published: (2023)
Computing the Bandwidth of Meager Timed Automata
by: Asarin, Eugene, et al.
Published: (2024)
by: Asarin, Eugene, et al.
Published: (2024)
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)
Hexagonal Picture Scanning Automata
by: D, Deepalakshmi, et al.
Published: (2025)
by: D, Deepalakshmi, et al.
Published: (2025)
Learning Automata with Name Allocation
by: Frank, Florian, et al.
Published: (2025)
by: Frank, Florian, et al.
Published: (2025)
Decomposition of Automata recognizing Ideals
by: Berry, Mathias, et al.
Published: (2026)
by: Berry, Mathias, et al.
Published: (2026)
Axiomatizing NFAs Generated by Regular Grammars
by: Gorrieri, Roberto
Published: (2024)
by: Gorrieri, Roberto
Published: (2024)
Alternating Nominal Automata with Name Allocation
by: Frank, Florian, et al.
Published: (2024)
by: Frank, Florian, et al.
Published: (2024)
Nominal Tree Automata With Name Allocation
by: Prucker, Simon, et al.
Published: (2024)
by: Prucker, Simon, 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)
by: Diekert, Volker, et al.
Published: (2019)
An $L^{\#}$ Based Algorithm for Active Learning of Minimal Separating Automata
by: Laumen, Jasper, et al.
Published: (2026)
by: Laumen, Jasper, et al.
Published: (2026)
Bandwidth of Nondeterministic Finite Automata
by: Cho, Da-Jung, et al.
Published: (2026)
by: Cho, Da-Jung, et al.
Published: (2026)
Weighing Obese Timed Languages
by: Asarin, Eugene, et al.
Published: (2025)
by: Asarin, Eugene, et al.
Published: (2025)
A generalization of Deterministic Finite Automata related to discharging
by: Campbell, John M.
Published: (2025)
by: Campbell, John M.
Published: (2025)
On the Equivalence Checking Problem for Deterministic Top-Down Tree Automata
by: Deng, Zhibo, et al.
Published: (2025)
by: Deng, Zhibo, et al.
Published: (2025)
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)
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)
Adversarial Synchronization
by: Lipin, Anton E., et al.
Published: (2026)
by: Lipin, Anton E., et al.
Published: (2026)
Addition Automata and Attractors of Digit Systems Corresponding to Expanding Rational Matrices
by: Cruz, Anjelo Gabriel R., et al.
Published: (2025)
by: Cruz, Anjelo Gabriel R., et al.
Published: (2025)
A polynomial-time algorithm for the automatic Baire property
by: Staiger, Ludwig
Published: (2025)
by: Staiger, Ludwig
Published: (2025)
A note on Automatic Baire property
by: Staiger, Ludwig
Published: (2025)
by: Staiger, Ludwig
Published: (2025)
On Languages Describing Large Graph Classes
by: Fernau, Henning, et al.
Published: (2026)
by: Fernau, Henning, et al.
Published: (2026)
Equivalence of Deterministic Weighted Real-time One-Counter Automata
by: Mathew, Prince, et al.
Published: (2024)
by: Mathew, Prince, et al.
Published: (2024)
Evolution-Based Timed Opacity under a Universal Observation Model
by: Zhang, Zhe, et al.
Published: (2026)
by: Zhang, Zhe, et al.
Published: (2026)
Deterministic Suffix-reading Automata
by: Keerthan, R, et al.
Published: (2024)
by: Keerthan, R, et al.
Published: (2024)
On Constructing Finite Automata by Relational Programming
by: Egri-Nagy, Attila, et al.
Published: (2025)
by: Egri-Nagy, Attila, et al.
Published: (2025)
Jump Complexity of Deterministic Finite Automata with Translucent Letters
by: Fazekas, Szilárd Zsolt, et al.
Published: (2025)
by: Fazekas, Szilárd Zsolt, et al.
Published: (2025)
Regular Model Checking for Systems with Effectively Regular Reachability Relation
by: Esparza, Javier, et al.
Published: (2025)
by: Esparza, Javier, et al.
Published: (2025)
Reachability for Multi-Priced Timed Automata with Positive and Negative Rates
by: Scoones, Andrew, et al.
Published: (2024)
by: Scoones, Andrew, et al.
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)
Runs, Squares, Palindromes, and Unbordered Factors of a Family of Binary Pattern Sequences with the All-One Pattern
by: Hendel, Russell Jay
Published: (2025)
by: Hendel, Russell Jay
Published: (2025)
From regular expressions to deterministic finite automata: $2^{\frac{n}{2}+\sqrt{n}(\log n)^{Θ(1)}}$ states are necessary and sufficient
by: Martynova, Olga, et al.
Published: (2025)
by: Martynova, Olga, et al.
Published: (2025)
Similar Items
-
Deterministic Suffix-reading Automata
by: Keerthan, R, et al.
Published: (2025) -
Polynomial Complementation of Nondeterministic 2-Way Finite Automata by 1-Limited Automata
by: Guillon, Bruno, et al.
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) -
Hypernode Automata
by: Bartocci, Ezio, et al.
Published: (2023)