论文信息 - Nondeterministic Descriptional Complexity Of Regular Languages

Nondeterministic Descriptional Complexity Of Regular Languages

We investigate the descriptional complexity of operations on finite and infinite regular languages over unary and arbitrary alphabets. The languages are represented by nondeterministic finite automata (NFA). In particular, we consider Boolean operations, catenation operations – concatenation, iteration, λ-free iteration – and the reversal. Most of the shown bounds are tight in the exact number of states, i.e. the number is sufficient and necessary in the worst case. Otherwise tight bounds in the order of magnitude are shown.

Martin Kutrib | Markus Holzer

[1] Sheng Yu,et al. Minimal cover-automata for finite languages , 2001, Theor. Comput. Sci..

[2] Michael Sipser. Lower Bounds on the Size of Sweeping Automata , 1980, J. Comput. Syst. Sci..

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

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

[5] M. Szalay,et al. On the maximal order in $S_n$ and $S*_n$ , 1980 .

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

[7] T. G. Szymanski,et al. On the Equivalence, Containment, and Covering Problems for the Regular and Context-Free Languages , 1976, J. Comput. Syst. Sci..

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

[9] Carlo Mereghetti,et al. Optimal Simulations Between Unary Automata , 1998, STACS.

[10] Jean-Camille Birget,et al. Partial Orders on Words, Minimal Elements of Regular Languages and State Complexity , 1993, Theor. Comput. Sci..

[11] Tao Jiang,et al. Minimal NFA Problems are Hard , 1991, SIAM J. Comput..

[12] Jean-Camille Birget. State-complexity of finite-state devices, state compressibility and incompressibility , 2005, Mathematical systems theory.