Descriptional Complexity of Bounded Regular Languages

We investigate the descriptional complexity of the subregular language classes of (strongly) bounded regular languages. In the first part, we study the costs for the determinization of nondeterministic finite automata accepting strongly bounded regular languages. The upper bound for the costs is larger than the costs for determinizing unary regular languages, but lower than the costs for determinizing arbitrary regular languages. In the second part, we study for (strongly) bounded languages the deterministic operational state complexity of the Boolean operations as well as the operations reversal, concatenation, and iteration. In detail, we present upper and lower bounds and we develop for the proof of the lower bounds a tool that exploits the number of different colorings of cycles occurring in deterministic finite automata accepting bounded languages.

[1]  Martin Erickson,et al.  Introduction to Combinatorics , 2013 .

[2]  Sheng Yu,et al.  State Complexity of Regular Languages , 2001, J. Autom. Lang. Comb..

[3]  Jeffrey Shallit,et al.  Unary Language Operations, State Complexity and Jacobsthal's Function , 2002, Int. J. Found. Comput. Sci..

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

[5]  Martin Kutrib,et al.  Determination of finite automata accepting subregular languages , 2009, Theor. Comput. Sci..

[6]  Jeffrey Shallit,et al.  A Lower Bound Technique for the Size of Nondeterministic Finite Automata , 1996, Inf. Process. Lett..

[7]  A. R. Meyer,et al.  Economy of Description by Automata, Grammars, and Formal Systems , 1971, SWAT.

[8]  Oscar H. Ibarra,et al.  On bounded languages and reversal-bounded automata , 2016, Inf. Comput..

[9]  Seymour Ginsburg,et al.  The mathematical theory of context free languages , 1966 .

[10]  Leslie G. Valiant,et al.  Regularity and Related Problems for Deterministic Pushdown Automata , 1975, JACM.

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

[12]  Martin J. Erickson.  Introduction to Combinatorics: Erickson/Introduction , 1996 .

[13]  Andreas Malcher,et al.  Descriptional complexity of bounded context-free languages , 2013, Inf. Comput..

[14]  Ernst L. Leiss,et al.  Succint Representation of Regular Languages by Boolean Automata , 1981, Theor. Comput. Sci..

[15]  Sheng Yu,et al.  NFA to DFA Transformation for Finite Languages over Arbitrary Alphabets , 1998, J. Autom. Lang. Comb..

[16]  Oscar H. Ibarra,et al.  Reversal-Bounded Multicounter Machines and Their Decision Problems , 1978, JACM.

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

[18]  Yuan Gao,et al.  A Survey on Operational State Complexity , 2015, J. Autom. Lang. Comb..

[19]  守屋 悦朗,et al.  J.E.Hopcroft, J.D. Ullman 著, "Introduction to Automata Theory, Languages, and Computation", Addison-Wesley, A5変形版, X+418, \6,670, 1979 , 1980 .

[20]  Marek Chrobak,et al.  Errata to: "finite automata and unary languages" , 2003 .

[21]  Oscar H. Ibarra,et al.  Characterizations of Bounded semilinear Languages by One-Way and Two-Way Deterministic Machines , 2012, Int. J. Found. Comput. Sci..

[22]  Marek Chrobak,et al.  Finite Automata and Unary Languages , 1986, Theor. Comput. Sci..