759 search results - page 52 / 152 » Odometers on Regular Languages |
170
click to vote
NAACL
2010
15 years 4 months ago
2010
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...
169
click to vote
FUIN
2010
15 years 3 months ago
2010
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 ...
170
click to vote
EPIA
1995
Springer
15 years 9 months ago
1995
Springer
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...
149
click to vote
FOSSACS
2004
Springer
15 years 11 months ago
2004
Springer
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...
157
click to vote
NLPRS
2001
Springer
15 years 10 months ago
2001
Springer
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...