Synchronizing automata preserving a chain of partial orders
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1346363 (Why is no real title available?)
- scientific article; zbMATH DE number 3222112 (Why is no real title available?)
- scientific article; zbMATH DE number 3368555 (Why is no real title available?)
- An extremal problem for two families of sets
- Composition sequences for functions over a finite domain.
- Developments in Language Theory
- Model-based testing of reactive systems. Advanced lectures.
- On two Combinatorial Problems Arising from Automata Theory
- Orienting polygonal parts without sensors
- RANK PROBLEMS FOR COMPOSITE TRANSFORMATIONS
- Reset Sequences for Monotonic Automata
- Reset words for commutative and solvable automata
- Synchronizing Automata and the Černý Conjecture
- Synchronizing finite automata on Eulerian digraphs.
- Synchronizing generalized monotonic automata
- The Černý conjecture for aperiodic automata
Cited in
(27)- scientific article; zbMATH DE number 2040899 (Why is no real title available?)
- Semisimple synchronizing automata and the Wedderburn-Artin theory
- A bound for the length of the shortest reset words for semisimple synchronizing automata via the packing number
- Complexity of problems concerning reset words for cyclic and Eulerian automata
- Preimage problems for deterministic finite automata
- Representation of (left) ideal regular languages by synchronizing automata
- Computational complexity of synchronization under sparse regular constraints
- Lower Bound for the Length of Synchronizing Words in Partially-Synchronizing Automata
- Sync-maximal permutation groups equal primitive permutation groups
- Synchronizing groups and automata
- Strongly connected synchronizing automata and the language of minimal reset words
- Synchronizing Automata Preserving a Chain of Partial Orders
- Checking whether an automaton is monotonic is NP-complete
- Ideal regular languages and strongly connected synchronizing automata
- Completely Reachable Automata: An Interplay Between Automata, Graphs, and Trees
- Extremal synchronizing circular automata
- Slowly synchronizing automata with zero and noncomplete sets
- Lower bounds for the length of reset words in Eulerian automata
- The Černý conjecture and 1-contracting automata
- Complexities of some problems related to synchronizing, non-synchronizing and monotonic automata
- An extremal series of Eulerian synchronizing automata
- scientific article; zbMATH DE number 7228447 (Why is no real title available?)
- Complexity of preimage problems for deterministic finite automata
- Complexity of problems concerning reset words for cyclic and Eulerian automata
- Primitive digraphs with large exponents and slowly synchronizing automata
- Synchronizing series-parallel deterministic finite automata with loops and related problems
- A linear bound on the \(k\)-rendezvous time for primitive sets of NZ matrices
This page was built for publication: Synchronizing automata preserving a chain of partial orders
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q840772)
