Titlebook: Mathematical Foundations of Computer Science 2002; 27th International S Krzysztof Diks,Wojciech Rytter Conference proceedings 2002 Springer

custody

下級

加劇

Accessibility in Automata on Scattered Linear Orderingsite words introduced by Büchi. In this paper, we show that if only words indexed by scattered linear orderings are considered, the accessibility and the emptiness in these automata can be checked in time .. where . and . are the number of states and the number of transitions. This solves the problem

abreast

被告

惡臭

Coloring ,-Colorable Semirandom Graphs in Polynomial Expected Time via Semidefinite Programmingf this paper is to present an algorithm for finding a large independent set in a semirandom graph in polynomial expected time, thereby extending the work of Feige and Kilian [.]. In order to preprocess the input graph, the algorithm makes use of SDP-based techniques. The analysis of the algorithm sh

angina-pectoris

On Word Equations in One Variablee. This is the best result known and for the equations that feature #. < ./log. it yields time complexity of .(.) which is optimal. Additionally, we prove that the set of solutions of one-variable word equations is either of the form . where . is a set of .(log.) words or of the form . ∪ (.).. where

組成

帶子

Two-Way Finite State Transducers with Nested Pebblesnsductions computed by such pebble transducers are closed under composition, and they can be realized by the composition of one-pebble transducers. The ranges of the .-pebble transducers form a hierarchy with respect to ., their finiteness problem is decidable, and they can be generated by compositi

FECT