On the State Complexity of Scattered Substrings and Superstrings

It is proved that the set of scattered substrings of a language recognized by an n-state DFA requires a DFA with at least 2$^{n/2-2}$ states (the known upper bound is 2$^n$), with witness languages given over an exponentially growing alphabet. For a 3-letter alphabet, scattered substrings are shown to require at least 2$^{sqrt{2n+30}-6}$ states. A similar state complexity function for scattered superstrings is determined to be exactly 2$^{n-2}$ + 1 for an alphabet of at least n − 2 letters, and strictly less for any smaller alphabet. For a 3-letter alphabet, the state complexity of scattered superstrings is at least 1/5 4sqrt{n/2}n-3/4.

[1]  Derick Wood,et al.  On the state complexity of reversals of regular languages , 2004, Theor. Comput. Sci..

[2]  L. H. Haines.  On free monoids partially ordered by embedding , 1969 .

[3]  Galina Jirásková,et al.  State complexity of some operations on binary regular languages , 2005, Theor. Comput. Sci..

[4]  Narad Rampersad.  The state complexity of L2 and Lk , 2006, Inf. Process. Lett..

[5]  Graham Higman,et al.  Ordering by Divisibility in Abstract Algebras , 1952 .

[6]  Alexander Okhotin,et al.  State complexity of cyclic shift , 2008, RAIRO Theor. Informatics Appl..

[7]  Martin Kutrib,et al.  The size of Higman-Haines sets , 2007, Theor. Comput. Sci..

[8]  Narad Rampersad.  The state complexity of L^2 and L^k , 2004 .

[9]  Sheng Yu,et al.  Tight Lower Bound for the State Complexity of Shuffle of Regular Languages , 2002, J. Autom. Lang. Comb..

[10]  Jean-Camille Birget,et al.  Intersection and Union of Regular Languages and State Complexity , 1992, Inf. Process. Lett..

[11]  Charalambos A. Charalambides,et al.  Enumerative combinatorics , 2018, SIGA.

[12]  Jan van Leeuwen,et al.  Effective constructions in well-partially- ordered free monoids , 1978, Discret. Math..

[13]  Martin Kutrib,et al.  More on the Size of Higman-Haines Sets: Effective Constructions , 2007, Fundam. Informaticae.

[14]  Sheng Yu,et al.  The State Complexities of Some Basic Operations on Regular Languages , 1994, Theor. Comput. Sci..

[15]  Arto Salomaa,et al.  State complexity of combined operations , 2007, Theor. Comput. Sci..

[16]  Jeffrey Shallit.  New Directions in State Complexity , 2006, DCFS.