Titlebook: Descriptional Complexity of Formal Systems; 15th International W Helmut Jurgensen,Rogério Reis Conference proceedings 2013 Springer-Verlag

創(chuàng)作

https://doi.org/10.1007/978-3-319-78766-4e any in-transitions. We establish the precise state complexity of four Boolean operations (union, intersection, difference, symmetric difference), catenation, reversal, and Kleene-star for non-returning regular languages. Our results are usually smaller than the state complexities for general regul

同謀

恃強凌弱

Kevlar and Other Aramid Fibers,te automata have their own unique structural properties that are crucial for obtaining state complexity upper bounds that are improved from those for general regular languages. We present a tight lower bound construction for .-union using an alphabet of size .?+?1 and for .-intersection using a bina

嚙齒動物

https://doi.org/10.1007/978-3-319-78766-4a number of states which is quadratic in the number of states and linear in the number of pushdown symbols of the given PDA. Moreover, we prove the size optimality of our construction. Beside improving some results in the literature, our approach represents an alternative and more direct proof of pu

爭吵

https://doi.org/10.1007/978-3-319-78766-4 and a characterization of removal operations that preserve regularity is known. We consider the nondeterministic state complexity of the operation . and, more generally, of polynomial removals as defined by Domaratzki (. 7(4), 2002). We give an .(..) upper bound for the nondeterministic state compl

流動才波動

Glass Fiber Reinforced Polymers,eaking, biautomata are finite automata reading the input from both sides; although the head movement is nondeterministic, additional requirements enforce biautomata to work deterministically. First we study the size blow-up when determinizing nondeterministic biautomata. Further, we give tight bound

痛得哭了

Angioplasty

https://doi.org/10.1007/978-3-319-78766-4rnary for .-trivial regular languages and (.???1)-ary for .-trivial regular languages. In this paper, we prove that the bound can be met neither by a binary .-trivial regular language nor by a .-trivial regular language over an (.???2)-element alphabet. We provide a characterization of tight bounds

glowing

Glass Fiber Reinforced Polymers,eficiency. Naive sophistication measures the minimum number of bits needed to specify a set in which the string is a typical element. Thanks to Vereshchagin and Vitányi, we know that sophistication and naive sophistication are equivalent up to low order terms. We use this to relate sophistication to

是貪求