scientific article; zbMATH DE number 6432462

zbMath1314.68177arXiv1412.0975MaRDI QIDQ5249242

A. N. Trahtman, François Gonze, Raphaël M. Jungers

Publication date: 30 April 2015

Full work available at URL: https://arxiv.org/abs/1412.0975

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

automatasynchronizationČerný's conjecture

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (10)

Unnamed Item ⋮ Synchronizing Automata with Extremal Properties ⋮ Completely Reachable Automata: An Interplay Between Automata, Graphs, and Trees ⋮ On primitivity of sets of matrices ⋮ Preimage problems for deterministic finite automata ⋮ Complexity of a problem concerning reset words for Eulerian binary automata ⋮ On the Synchronizing Probability Function and the Triple Rendezvous Time for Synchronizing Automata ⋮ Experiments with Synchronizing Automata ⋮ Černý's conjecture and the road colouring problem ⋮ Primitive Sets of Nonnegative Matrices and Synchronizing Automata

This page was built for publication: