Cover Image

A cornering strategy for synchronizing a DFA

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Bradshaw, Peter, Clow, Alexander, Stacho, Ladislav
Format:	Preprint
Published:	2024
Subjects:	Formal Languages and Automata Theory Combinatorics 68Q45 (Primary) 68R10 (Secondary)
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Density of rational languages under shift invariant measures
by: Berthé, Valérie, et al.
Published: (2025)

The generating power of weighted tree automata with initial algebra semantics
by: Droste, Manfred, et al.
Published: (2024)

On A. V. Anisimov's problem for finding a polynomial algorithm checking inclusion of context-free languages in group languages
by: Yordzhev, Krasimir
Published: (2026)

A generalization of Deterministic Finite Automata related to discharging
by: Campbell, John M.
Published: (2025)

A quadratic upper bound on the reset thresholds of synchronizing automata containing a transitive permutation group
by: Zhu, Yinfeng
Published: (2024)

A Unary-to-Nonunary Transition in the Accepting-State Spectrum of Right Quotient for Permutation Automata
by: German, Samuel
Published: (2026)

A Note on the Relation between Recognisable Series and Regular Sequences, and their Minimal Linear Representations
by: Heuberger, Clemens, et al.
Published: (2022)

Evaluating Massively Parallel Algorithms for DFA Minimisation, Equivalence Checking and Inclusion Checking
by: Heemstra, Jan, et al.
Published: (2025)

From Historical Puzzles to Grammatical Constraints: Circular Partitions, Generalized Run-Length Encodings, and Polynomial-Time Decidability
by: Khormali, Omid, et al.
Published: (2026)

A hierarchy of reversible finite automata
by: Radionova, Maria, et al.
Published: (2024)

A lower bound on the state complexity of transforming two-way nondeterministic finite automata to unambiguous finite automata
by: Petrov, Semyon, et al.
Published: (2024)

Nondeterministic tree-walking automata are not closed under complementation
by: Martynova, Olga, et al.
Published: (2024)

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)

Semidirect Product Decompositions for Periodic Regular Languages
by: Inoue, Yusuke, et al.
Published: (2024)

Bandwidth of Nondeterministic Finite Automata
by: Cho, Da-Jung, et al.
Published: (2026)

On Computational Completeness of Semi-Conditional Matrix Grammars
by: Fernau, Henning, et al.
Published: (2024)

Mostowski Index via extended register games
by: Idir, Olivier, et al.
Published: (2024)

Linear equations and recursively enumerable sets
by: Honkala, Juha
Published: (2024)

Around Don's conjecture for binary completely reachable automata
by: Zhu, Yinfeng
Published: (2024)

An $L^{\#}$ Based Algorithm for Active Learning of Minimal Separating Automata
by: Laumen, Jasper, et al.
Published: (2026)

Bounded Languages Described by GF(2)-grammars
by: Makarov, Vladislav
Published: (2019)

Don's conjecture for binary completely reachable automata: an approach and its limitations
by: Casas, David, et al.
Published: (2023)

Effective Computation of Generalized Abelian Complexity for Pisot Type Substitutive Sequences
by: Couvreur, Jean-Michel, et al.
Published: (2025)

Normal forms in Virus Machines
by: Ramírez-de-Arellano, A., et al.
Published: (2024)

On the growth of hypergeometric sequences
by: Kenison, George, et al.
Published: (2025)

Weighted Automata and Logics Meet Computational Complexity
by: Kostolányi, Peter
Published: (2023)

Hamming distance between finite transducers
by: Dartois, Luc, et al.
Published: (2026)

Context-Free Trees
by: Wächter, Jan Philipp
Published: (2026)

Illustrating Finite Automata with Grail+ and TikZ
by: May, Alastair, et al.
Published: (2024)

A note on Automatic Baire property
by: Staiger, Ludwig
Published: (2025)

A polynomial-time algorithm for the automatic Baire property
by: Staiger, Ludwig
Published: (2025)

A Connection Between Unbordered Partial Words and Sparse Rulers
by: Saarela, Aleksi, et al.
Published: (2024)

On Quantum Context-Free Grammars
by: Aruja, Merina, et al.
Published: (2025)

Permutation closure for multiple context-free languages
by: Duncan, Andrew, et al.
Published: (2025)

On Languages Describing Large Graph Classes
by: Fernau, Henning, et al.
Published: (2026)

Dissecting power of intersection of two context-free languages
by: Rukavicka, Josef
Published: (2020)

Weakly-unambiguous Parikh automata and their link to holonomic series
by: Bostan, Alin, et al.
Published: (2025)

Computing the k-binomial complexity of generalized Thue--Morse words
by: Golafshan, M., et al.
Published: (2024)

The Shortest Interesting Binary Words
by: Fici, Gabriele
Published: (2024)

Subword enumeration up to stack-sorting equivalence
by: Campbell, John M., et al.
Published: (2026)