Pages that link to "Item:Q1401241"
From MaRDI portal
The following pages link to Synchronizing finite automata on Eulerian digraphs. (Q1401241):
Displaying 15 items.
- (Q4779162) (← links)
- Complexity of Preimage Problems for Deterministic Finite Automata (Q5005132) (← links)
- (Q5005150) (← links)
- Synchronizing series-parallel deterministic finite automata with loops and related problems (Q5021111) (← links)
- A Linear Bound on the k-rendezvous Time for Primitive Sets of NZ Matrices (Q5158650) (← links)
- A Unified Method to Decentralized State Detection and Fault Diagnosis/prediction of Discrete-event Systems (Q5158671) (← links)
- Complexity of Problems Concerning Reset Words for Cyclic and Eulerian Automata (Q5200068) (← links)
- Synchronised automata (Q5365563) (← links)
- On the Interplay Between Černý and Babai’s Conjectures (Q5384433) (← links)
- SYNCHRONIZING QUASI-EULERIAN AND QUASI-ONE-CLUSTER AUTOMATA (Q5401552) (← links)
- The Synchronizing Probability Function for Primitive Sets of Matrices (Q5859647) (← links)
- Primitivity and Hurwitz Primitivity of Nonnegative Matrix Tuples: A Unified Approach (Q5885810) (← links)
- Synchronization problems in automata without non-trivial cycles (Q5919579) (← links)
- Completely Reachable Automata: An Interplay Between Automata, Graphs, and Trees (Q6072405) (← links)
- The road problem and homomorphisms of directed graphs (Q6175007) (← links)