Pages that link to "Item:Q2019491"
From MaRDI portal
The following pages link to Computational complexity of synchronization under regular commutative constraints (Q2019491):
Displaying 8 items.
- Constrained synchronization and subset synchronization problems for weakly acyclic automata (Q832939) (← links)
- A complexity-based classification for multiprocessor synchronization (Q1988522) (← links)
- Computational complexity of synchronization under sparse regular constraints (Q2140506) (← links)
- Constrained synchronization and commutativity (Q2235741) (← links)
- Algebraic synchronization criterion and computing reset words (Q2282077) (← links)
- Computational complexity studies of synchronous Boolean finite dynamical systems on directed graphs (Q2407103) (← links)
- Ideal separation and general theorems for constrained synchronization and their application to small constraint automata (Q2695284) (← links)
- The Ordered and Colored Products in Analytic Combinatorics: Application to the Quantitative Study of Synchronizations in Concurrent Processes (Q5195032) (← links)