Computational Complexity of Synchronization under Regular Constraints

We introduce the notion of a semicomputable point in R^n , defined as a point having left-c.e. projections. We study the range of such a point, which is the set of directions on which its projections are left-c.e., and is a convex cone. We provide a thorough study of these notions, proving along the way new results on the computability of convex sets. We prove realization results, by identifying computability properties of convex cones that make them ranges of semicomputable points. We give two applications of the theory. The first one provides a better understanding of the Solovay derivatives. The second one is the investigation of left-c.e. quadratic polynomials. We show that this is, in fact, a particular case of the general theory of semicomputable points.

[1]  Pavel Martyugin.  Complexity of Problems Concerning Reset Words for Some Partial Cases of Automata , 2009, Acta Cybern..

[2]  Jeffrey Shallit,et al.  On the Number of Distinct Languages Accepted by Finite Automata with n States , 2002, DCFS.

[3]  Mikhail V. Berlinkov.  Approximating the Minimum Length of Synchronizing Words Is Hard , 2010, CSR.

[4]  Nelma Moreira,et al.  On the Representation of Finite Automata , 2005, DCFS.

[5]  Hans Zantema,et al.  Lower Bounds for Synchronizing Word Lengths in Partial Automata , 2019, Int. J. Found. Comput. Sci..

[6]  Vladimir V. Gusev,et al.  Primitive digraphs with large exponents and slowly synchronizing automata , 2013, Journal of Mathematical Sciences.

[7]  Henning Fernau,et al.  Problems on Finite Automata and the Exponential Time Hypothesis , 2016, CIAA.

[8]  Mikhail V. Berlinkov,et al.  Complexity of Preimage Problems for Deterministic Finite Automata , 2017, MFCS.

[9]  Frédérique Bassino,et al.  Enumeration and random generation of accessible automata , 2007, Theor. Comput. Sci..

[10]  J. Taylor,et al.  Switching and finite automata theory, 2nd ed. , 1980, Proceedings of the IEEE.

[11]  Dexter Kozen,et al.  Lower bounds for natural proof systems , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[12]  Szabolcs Iván,et al.  Improved upper bounds on synchronizing nondeterministic automata , 2009, Inf. Process. Lett..

[13]  Kim G. Larsen,et al.  Synchronizing Strategies under Partial Observability , 2014, CONCUR.

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

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

[16]  I. K. Rystsov,et al.  Polynomial Complete Problems in Automata Theory , 1983, Inf. Process. Lett..

[17]  V. Blondel,et al.  The presence of a zero in an integer linear recurrent sequence is NP-hard to decide , 2002 .

[18]  Pavel Martyugin.  Computational Complexity of Certain Problems Related to Carefully Synchronizing Words for Partial Automata and Directing Words for Nondeterministic Automata , 2013, Theory of Computing Systems.

[19]  Richard J. Lipton,et al.  Polynomial-time algorithm for the orbit problem , 1986, JACM.

[20]  Nelma Moreira,et al.  Enumeration and generation with a string automata representation , 2007, Theor. Comput. Sci..

[21]  Dominique Perrin,et al.  A Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster Automata , 2009, Developments in Language Theory.