scientific article; zbMATH DE number 7378365
From MaRDI portal
Publication:5005150
DOI10.4230/LIPIcs.MFCS.2018.48MaRDI QIDQ5005150
Raphaël M. Jungers, Costanza Catalano
Publication date: 4 August 2021
Full work available at URL: https://arxiv.org/abs/1805.06723
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
synchronizing automataČerný conjectureprimitive sets of matricesautomata with simple idempotentsrandom automata
Related Items (3)
Fast synchronization of inhomogenous random automata ⋮ A Linear Bound on the k-rendezvous Time for Primitive Sets of NZ Matrices ⋮ The Synchronizing Probability Function for Primitive Sets of Matrices
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Primitive digraphs with large exponents and slowly synchronizing automata
- Lower and upper bounds for the largest Lyapunov exponent of matrices
- Sets of nonnegative matrices without positive products
- On primitivity of sets of matrices
- Combinatorial properties of entire semigroups of nonnegative matrices
- An extremal problem for two families of sets
- Synchronizing finite automata on Eulerian digraphs.
- The complexity of oblivious plans for orienting and distinguishing polygonal parts
- DFAs and PFAs with long shortest synchronizing word length
- On the interplay between Babai and Černý's conjectures
- On the Probability of Being Synchronizable
- An Extremal Series of Eulerian Synchronizing Automata
- Synchronizing Automata with Extremal Properties
- A QUADRATIC UPPER BOUND ON THE SIZE OF A SYNCHRONIZING WORD IN ONE-CLUSTER AUTOMATA
- Primitive Sets of Nonnegative Matrices and Synchronizing Automata
- Reset Thresholds of Automata with Two Cycle Lengths
- Reset Sequences for Monotonic Automata
- Synchronizing Automata Preserving a Chain of Partial Orders
- Synchronizing Automata and the Černý Conjecture
- The Complexity of Finding Reset Words in Finite Automata
- On two Combinatorial Problems Arising from Automata Theory
- Attainable Values of Reset Thresholds
- Estimation of the length of reset words for automata with simple idempotents
This page was built for publication:
