Reset Sequences for Monotonic Automata
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Synchronizing finite automata with short reset words
- Strongly transitive automata and the Černý conjecture
- Reset words for commutative and solvable automata
- Computational complexity of certain problems related to carefully synchronizing words for partial automata and directing words for nondeterministic automata
- Synchronizing generalized monotonic automata
- Composition sequences for functions over a finite domain.
- The complexity of oblivious plans for orienting and distinguishing polygonal parts
- The NP-completeness of the road coloring problem
- Analytic methods for reachability problems
- Slowly synchronizing automata with fixed alphabet size
- Extremal synchronizing circular automata
- Černý's conjecture and the road colouring problem
- Synchronizing words for real-time deterministic pushdown automata (extended abstract)
- Computational complexity of problems for deterministic presentations of sofic shifts
- Sync-maximal permutation groups equal primitive permutation groups
- Distributed graph problems through an automata-theoretic Lens
- Cerny's conjecture for automata with simple idempotents
- Computational complexity of synchronization under sparse regular constraints
- Some results concerning careful synchronization of partial automata and subset synchronization of DFA's
- Constrained synchronization for monotonic and solvable automata and automata with simple idempotents
- Synchronizing times for k-sets in automata
- Synchronizing sequences for road colored digraphs
- Preimage problems for deterministic finite automata
- A multi-parameter analysis of hard problems on deterministic finite automata
- A complete solution to the complexity of synchronizing road coloring for non-binary alphabets
- Computing the shortest reset words of synchronizing automata
- A quadratic algorithm for road coloring
- Distributed graph problems through an automata-theoretic lens
- On the synchronizing probability function and the triple rendezvous time. New approaches to Černý's conjecture
- On the synchronizing probability function and the triple rendezvous time for synchronizing automata
- Synchronizing automata over nested words
- An extremal series of Eulerian synchronizing automata
- Experiments with Synchronizing Automata
- Lower bounds for the length of reset words in Eulerian automata
- On a conjecture by Carpi and D'Alessandro
- Synchronization of automata with one undefined or ambiguous transition
- Strong inapproximability of the shortest reset word
- On the Number of Synchronizing Colorings of Digraphs
- Checking whether an automaton is monotonic is NP-complete
- WORDS GUARANTEEING MINIMUM IMAGE
- COMPAS -- a computing package for synchronization
- Approximating minimum reset sequences
- Recognizing synchronizing automata with finitely many minimal synchronizing words is PSPACE-complete
- The Černý conjecture and 1-contracting automata
- Primitive sets of nonnegative matrices and synchronizing automata
- Non-dominating sequences of vectors using only resets and increments
- Surface dimension, tiles, and synchronizing automata
- scientific article; zbMATH DE number 7228447 (Why is no real title available?)
- Notable trends concerning the synchronization of graphs and automata
- Synchronizing Automata Preserving a Chain of Partial Orders
- Synchronizing Automata and the Černý Conjecture
- Shortest Synchronizing Strings for Huffman Codes
- Genetic Algorithm for Synchronization
- scientific article; zbMATH DE number 4082982 (Why is no real title available?)
- Groups synchronizing a transformation of non-uniform kernel
- Complexity of problems concerning reset words for cyclic and Eulerian automata
- Hardness and inapproximability of minimizing adaptive distinguishing sequences
- Finding short synchronizing words for prefix codes
- Complexity of preimage problems for deterministic finite automata
- On randomized generation of slowly synchronizing automata
- Synchronizing series-parallel deterministic finite automata with loops and related problems
- Synchronizing words and monoid factorization, yielding a new parameterized complexity class?
- Synchronizing deterministic push-down automata can be really hard
- Černý conjecture for edge-colored digraphs with few junctions
- A note on polynomial approximation of synchronizing optimal coloring
- Complexity of a problem concerning reset words for Eulerian binary automata
- A linear bound on the \(k\)-rendezvous time for primitive sets of NZ matrices
- A Unified Method to Decentralized State Detection and Fault Diagnosis/prediction of Discrete-event Systems
- Complexity of problems concerning reset words for cyclic and Eulerian automata
- Experimental study of the shortest reset word of random automata
- Complexities of some problems related to synchronizing, non-synchronizing and monotonic automata
- The Synchronizing Probability Function for Primitive Sets of Matrices
- Synchronizing almost-group automata
- Estimation of the length of reset words for automata with simple idempotents
- Orienting polyhedral parts by pushing
- Completely distinguishable automata and the set of synchronizing words
- Completely Reachable Automata: An Interplay Between Automata, Graphs, and Trees
- Synchronizing automata with coinciding cycles
- The road problem and homomorphisms of directed graphs
- Binary and circular automata having maximal state complexity for the set of synchronizing words
- Synchronizing deterministic push-down automata can be really hard
- Orienting polygonal parts without sensors
- Reset sink complexity of regular ideals
- The complexity of traversing automata with current state uncertainty under \(\mathrm{LTL}_{f}\) constraints
- Subset mapping problems in solvable automata
- An improved algorithm for finding the shortest synchronizing words
- Careful synchronization of one-cluster automata
- Synchronizing monotonic automata
- A cornering strategy for synchronizing a DFA
- Synchronizing strongly connected partial DFAs
- Completely distinguishable automata and the set of synchronizing words
- The hereditariness problem for the Černý conjecture
- Title not available (Why is no real title available?)
- The relation between preset distinguishing sequences and synchronizing sequences
- Constrained synchronization and subset synchronization problems for weakly acyclic automata
- Shortest synchronizing strings for Huffman codes
- Synchronizing automata preserving a chain of partial orders
- The annulation threshold for partially monotonic automata
- A lower bound for the length of the shortest carefully synchronizing words
- Synchronizing automata with a letter of deficiency 2
This page was built for publication: Reset Sequences for Monotonic Automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3476281)
