论文信息 - Ideal Separation and General Theorems for Constrained Synchronization and Their Application to Small Constraint Automata - 字舞流文

Ideal Separation and General Theorems for Constrained Synchronization and Their Application to Small Constraint Automata

Stefan Hoffmann

[1] Seymour Ginsburg,et al. BOUNDED REGULAR SETS , 1966 .

[2] Gilles Pesant,et al. A Regular Language Membership Constraint for Finite Sequences of Variables , 2004, CP.

[3] Adam Roman,et al. Complexity of road coloring with prescribed reset words , 2019, J. Comput. Syst. Sci..

[4] Stefan Hoffmann. Computational Complexity of Synchronization under Regular Commutative Constraints , 2020, COCOON.

[5] Sven Sandberg,et al. Homing and Synchronizing Sequences , 2004, Model-Based Testing of Reactive Systems.

[6] Vladimir V. Gusev. Synchronizing Automata of Bounded Rank , 2012, CIAA.

[7] Mikhail V. Volkov,et al. Synchronizing Automata and the Cerny Conjecture , 2008, LATA.

[8] Volker Diekert,et al. The existential theory of equations with rational constraints in free groups is PSPACE-complete , 2005, Inf. Comput..

[9] Jean-François Romeuf. Shortest Path Under Rational Constraint , 1988, Inf. Process. Lett..

[10] Pavel Martyugin,et al. Synchronization of Automata with One Undefined or Ambiguous Transition , 2012, CIAA.