On Emptiness and Counting for Alternating Finite Automata

This invention relates to an improvement in a transverse, force-connected body with variable profiling, particularly an airplane wing, containing flexible upper, lower, and nose skin parts and supporting elements hingedly engaging thereat in conjunction with a control gear, the improvement comprising clamps securing the upper and lower flexible skin parts at a rigid part of the wing, rigid carriers in the upper and lower areas of the wing, and shaped profile elements on the upper and lower carriers, the shaped profile elements having outwardly-pointing shaped profile surfaces for the selective support of the flexible skin parts.

[1]  Tao Jiang,et al.  A Note on the Space Complexity of Some Decision Problems for Finite Automata , 1991, Inf. Process. Lett..

[2]  Neil D. Jones,et al.  Space-Bounded Reducibility among Combinatorial Problems , 1975, J. Comput. Syst. Sci..

[3]  Peter Rossmanith,et al.  The Emptiness Problem for Intersections of Regular Languages , 1992, MFCS.

[4]  Klaus-Jörn Lange,et al.  A further link between formal languages and complexity theory , 1987, Bull. EATCS.

[5]  Carme Àlvarez,et al.  A very hard log space counting class , 1990, Proceedings Fifth Annual Structure in Complexity Theory Conference.