Sciweavers

213 search results - page 25 / 43
» Relating Word and Tree Automata
Sort
View
DM
2008
139views more  DM 2008»
13 years 7 months ago
On domination and reinforcement numbers in trees
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...
ACL
2010
13 years 5 months ago
Bayesian Synchronous Tree-Substitution Grammar Induction and Its Application to Sentence Compression
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...
Elif Yamangil, Stuart M. Shieber
LICS
2008
IEEE
14 years 1 months ago
From Automatic Structures to Borel Structures
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...
ICALP
1989
Springer
13 years 11 months ago
Causal Trees
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...
Philippe Darondeau, Pierpaolo Degano
ICALP
2010
Springer
14 years 10 days ago
A Topological Approach to Recognition
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...
Mai Gehrke, Serge Grigorieff, Jean-Eric Pin