Pages that link to "Item:Q5384430"
From MaRDI portal
The following pages link to Lower Bounds for Synchronizing Word Lengths in Partial Automata (Q5384430):
Displaying 11 items.
- Extremal binary PFAs in a Černý family (Q832924) (← links)
- Slowly synchronizing automata with fixed alphabet size (Q2042724) (← links)
- Extremal synchronizing circular automata (Q2051843) (← links)
- Some results concerning careful synchronization of partial automata and subset synchronization of DFA's (Q2164741) (← links)
- Careful synchronization of partial deterministic finite automata (Q2170286) (← links)
- Synchronizing sequences for road colored digraphs (Q2197412) (← links)
- Using SAT solvers for synchronization issues in non-deterministic automata (Q2633380) (← links)
- Semicomputable points in Euclidean spaces (Q5092426) (← links)
- D2-SYNCHRONIZATION IN NONDETERMINISTIC AUTOMATA (Q5125223) (← links)
- A Linear Bound on the k-rendezvous Time for Primitive Sets of NZ Matrices (Q5158650) (← links)
- Extremal Binary PFAs with Small Number of States (Q6169960) (← links)
