The reinforcement number of a graph is the smallest number of edges that have to be added to a graph to reduce the domination number. We introduce the k-reinforcement number of a ...
Jean R. S. Blair, Wayne Goddard, Stephen T. Hedetn...
We describe our experiments with training algorithms for tree-to-tree synchronous tree-substitution grammar (STSG) for monolingual translation tasks such as sentence compression a...
We study the classes of B¨uchi and Rabin automatic structures. For B¨uchi (Rabin) automatic structures their domains consist of infinite strings (trees), and the basic relation...
Greg Hjorth, Bakhadyr Khoussainov, Antonio Montalb...
Category theory has been successfully employed to structure the confusing setup of models and equivalences for concurrency: Winskel and Nielsen have related the standard models nc...
We propose a new approach to the notion of recognition, which departs from the classical definitions by three specific features. First, it does not rely on automata. Secondly, it...