Sciweavers

759 search results - page 52 / 152
» Odometers on Regular Languages
Sort
View
NAACL
2010
14 years 7 months ago
Why Synchronous Tree Substitution Grammars?
Synchronous tree substitution grammars are a translation model that is used in syntax-based machine translation. They are investigated in a formal setting and compared to a compet...
Andreas Maletti
FUIN
2010
98views more  FUIN 2010»
14 years 7 months ago
On the Borel Complexity of MSO Definable Sets of Branches
An infinite binary word can be identified with a branch in the full binary tree. We consider sets of branches definable in monadic second-order logic over the tree, where we allow ...
Mikolaj Bojanczyk, Damian Niwinski, Alexander Rabi...
EPIA
1995
Springer
15 years 1 months ago
The Retrieval Problem in a Concept Language with Number Restrictions
In this paper, we study the retrieval problem in ALN, which is a tractable concept language with number restrictions. Following the approach proposed in [12], this work differs fr...
Aida Vitória, Margarida Mamede, Luís...
FOSSACS
2004
Springer
15 years 3 months ago
On Recognizable Timed Languages
In this work we generalize the fundamental notion of recognizability from untimed to timed languages. The essence of our definition is the existence of a right-morphism from the m...
Oded Maler, Amir Pnueli
NLPRS
2001
Springer
15 years 2 months ago
Migemo: Incremental Search Method for Languages with Many Character Faces
We introduce a new incremental search method called Migemo for languages with many character faces. Migemo performs the incremental search by dynamically expanding the input patte...
Satoru Takabayashi, Hiroyuki Komatsu, Toshiyuki Ma...