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...
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...
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...
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...
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...