759 search results - page 73 / 152 » Overlap-Free Regular Languages |
ENTCS
2002
14 years 9 months ago
2002
The paper discusses the hierarchy of indices of finite automata over infinite objects. This hierarchy corresponds exactly to the hierarchy of alternations of least and greatest fi...
FUIN
2002
14 years 9 months ago
2002
We study caterpillar tree automata [3] that are restricted to enter any subtree at most one time (or k times). We show that, somewhat surprisingly, the deterministic one-visit aut...
NAACL
2010
14 years 7 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...
FUIN
2010
14 years 7 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 ...
EPIA
1995
Springer
15 years 1 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...