Titlebook: Descriptional Complexity of Formal Systems; 13 International Wor Markus Holzer,Martin Kutrib,Giovanni Pighizzini Conference proceedings 201

有恶意

State Complexity of Operations on Two-Way Deterministic Finite Automata over a Unary Alphabet+ .(.)). states, where . is the maximum value of .(.., …, ..) for ., known as Landau’s function; (iv) .-th power of an .-state 2DFA, between (. − 1).(.) − . and .(.(.) + .) states; (v) concatenation of an .-state and an .-state 2DFAs, . states.

鞠躬

审问

Finite Fields II: Additional Properties part, we sketch how this dual approach can be generalized to study some important class of boolean circuits, what results have been obtained, what questions are still open. The intuition gained in the simple model sometimes carry through, sometimes not, so that one has to be careful on what conjectures to make.