Computational complexity of synchronization under regular commutative constraints
From MaRDI portal
Recommendations
- Constrained synchronization and commutativity
- Semicomputable points in Euclidean spaces
- Computational complexity of synchronization under sparse regular constraints
- Ideal separation and general theorems for constrained synchronization and their application to small constraint automata
- Constrained synchronization and subset synchronization problems for weakly acyclic automata
Cites work
- scientific article; zbMATH DE number 1517989 (Why is no real title available?)
- scientific article; zbMATH DE number 3222112 (Why is no real title available?)
- Commutative regular languages -- properties and state complexity
- Extensions to minimal synchronizing words
- Learning Commutative Regular Languages
- Semicomputable points in Euclidean spaces
- Synchronization of automata with one undefined or ambiguous transition
- Synchronizing Automata and the Černý Conjecture
- Synchronizing automata of bounded rank
Cited in
(8)- Constrained synchronization and commutativity
- A complexity-based classification for multiprocessor synchronization
- Constrained synchronization and subset synchronization problems for weakly acyclic automata
- Computational complexity of synchronization under sparse regular constraints
- Computational complexity studies of synchronous Boolean finite dynamical systems on directed graphs
- Ideal separation and general theorems for constrained synchronization and their application to small constraint automata
- The Ordered and Colored Products in Analytic Combinatorics: Application to the Quantitative Study of Synchronizations in Concurrent Processes
- Semicomputable points in Euclidean spaces
This page was built for publication: Computational complexity of synchronization under regular commutative constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2019491)
