Constrained synchronization for monotonic and solvable automata and automata with simple idempotents
From MaRDI portal
Publication:2164757
Recommendations
- Constrained synchronization and commutativity
- Constrained synchronization and subset synchronization problems for weakly acyclic automata
- Ideal separation and general theorems for constrained synchronization and their application to small constraint automata
- Semicomputable points in Euclidean spaces
- Subset synchronization in monotonic automata
Cites work
- An improvement to a recent upper bound for synchronizing words of finite automata
- Checking whether an automaton is monotonic is NP-complete
- Complexity of problems concerning reset words for some partial cases of automata
- Constrained synchronization and commutativity
- Constrained synchronization and subset synchronization problems for weakly acyclic automata
- Estimation of the length of reset words for automata with simple idempotents
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 3222112 (Why is no real title available?)
- Ideal separation and general theorems for constrained synchronization and their application to small constraint automata
- Regular languages and partial commutations
- Reset Sequences for Monotonic Automata
- Reset words for commutative and solvable automata
- Semicomputable points in Euclidean spaces
- Subset synchronization in monotonic automata
- Synchronizing monotonic automata
- Černý's conjecture and the road colouring problem
Cited in
(3)
This page was built for publication: Constrained synchronization for monotonic and solvable automata and automata with simple idempotents
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2164757)
