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

直觉没有

Solace

State Complexity of Operations on Two-Way Deterministic Finite Automata over a Unary Alphabetse necessary to represent the results of the following operations: (i) intersection of an .-state 2DFA and an .-state 2DFA requires between . + . and . + . + 1 states; (ii) union of an .-state 2DFA and an .-state 2DFA, between . + . and 2. + . + 4 states; (iii) Kleene star of an .-state 2DFA, (.(.) 

AVID

LEVY

State Complexity of Four Combined Operations Composed of Union, Intersection, Star and ReversalIn this paper, we study the state complexities of union and intersection combined with star and reversal, respectively. We obtain the exact bounds for these combined operations on regular languages and show that, as usually, they are different from the mathematical compositions of the state complexities of their individual participating operations.

轻率的你

0302-9743 y; formal systems for applications (e.g., software reliability, software and hardware testing, modeling of natural languages); nature-motivated (bio-inspired) architectures and unconventional models of computing; Kolmogorov complexity.978-3-642-22599-4978-3-642-22600-7Series ISSN 0302-9743 Series E-ISSN 1611-3349

deficiency

产生

A Field Extension as a Vector Spacelar automaton in question is not surjective. All our results deal with one-dimensional cellular automata. Undecidability results imply that in higher dimensional cases no computable upper bound exists for any of the considered quantities.

STEER

增强

音的强弱

On Restarting Automata with Window Size Onearting automata in relation to the .(1)-automata on the one hand and the (deterministic and nondeterministic) finite-state acceptors on the other hand. Then various types of cooperating distributed systems (CD-systems) of deterministic .(1)-automata are presented. If all components of such a system