Jul 30, 2021 · The constrained synchronization problem (CSP) asks for a synchronizing word of a given input automaton contained in a regular set of constraints.
Sep 9, 2021 · The constrained synchronization problem (CSP) asks for a synchronizing word of a given input automaton contained in a regular set of constraints.
Sep 12, 2021 · It could be viewed as a special case of synchronization of a discrete event system under supervisory control. Here, we study the computational ...
The constrained synchronization problem (CSP) asks for a synchronizing word of a given input automaton contained in a regular set of constraints.
Here we study the computational complexity of the constrained synchronization problem for the class of regular commutative constraint languages.
Abstract. The constrained synchronization problem (CSP) asks for a synchronizing word of a given input automaton contained in a regular set of constraints.
The constrained synchronization problem (CSP) asks for a synchronizing word of a given input automaton contained in a regular set of constraints.
Computational Complexity of Synchronization under Regular Constraints instance, synchronizing automata adequately model situations in which one has to direct a.
Missing: Sparse | Show results with:Sparse
Statements · automata theory · constrained synchronization · computational complexity · sparse languages · bounded languages · strongly self-synchronizing codes.
Computational Complexity of Synchronization under Sparse Regular Constraints. International Symposium on Fundamentals of Computation Theory Pub Date : 2021 ...