Pages that link to "Item:Q3476281"
From MaRDI portal
The following pages link to Reset Sequences for Monotonic Automata (Q3476281):
Displayed 30 items.
- Surface Dimension, Tiles, and Synchronizing Automata (Q3300873) (← links)
- (Q3304155) (← links)
- Notable trends concerning the synchronization of graphs and automata (Q3439497) (← links)
- Synchronizing Automata Preserving a Chain of Partial Orders (Q3503892) (← links)
- Synchronizing Automata and the Černý Conjecture (Q3540093) (← links)
- Shortest Synchronizing Strings for Huffman Codes (Q3599120) (← links)
- Genetic Algorithm for Synchronization (Q3618622) (← links)
- (Q5005121) (← 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)
- Synchronizing words and monoid factorization, yielding a new parameterized complexity class? (Q5048011) (← links)
- (Q5089200) (← links)
- (Q5150411) (← 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)
- Experimental Study of the Shortest Reset Word of Random Automata (Q5200075) (← links)
- Complexities of Some Problems Related to Synchronizing, Non-Synchronizing and Monotonic Automata (Q5250279) (← links)
- The Synchronizing Probability Function for Primitive Sets of Matrices (Q5859647) (← links)
- Synchronizing Almost-Group Automata (Q5859664) (← links)
- Synchronization problems in automata without non-trivial cycles (Q5919579) (← links)
- Estimation of the length of reset words for automata with simple idempotents (Q5951300) (← links)
- Orienting polyhedral parts by pushing (Q5959552) (← links)
- Completely distinguishable automata and the set of synchronizing words (Q6067333) (← links)
- Completely Reachable Automata: An Interplay Between Automata, Graphs, and Trees (Q6072405) (← links)
- Synchronizing automata with coinciding cycles (Q6088948) (← links)
- The road problem and homomorphisms of directed graphs (Q6175007) (← links)
- Binary and circular automata having maximal state complexity for the set of synchronizing words (Q6186314) (← links)
- Synchronizing deterministic push-down automata can be really hard (Q6186317) (← links)