13 search results - page 2 / 3 » Regular Tree Grammars as a Formalism for Scope Underspecific... |
MFCS
2004
Springer
13 years 11 months ago
2004
Springer
A binary language-theoretic operation is proposed, which is dual to the concatenation of languages in the same sense as the universal quantifier in logic is dual to the existenti...
DLT
2010
13 years 7 months ago
2010
Abstract. Millstream systems have recently been proposed as a formalization of the linguistic idea that natural language should be described as a combination of different modules r...
NAACL
2010
13 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...
SAS
1999
Springer
13 years 10 months ago
1999
Springer
This paper describes a powerful method for dead code analysis and elimination in the presence of recursive data constructions. We describe partially dead recursive data using live...
STOC
2010
ACM
14 years 3 months ago
2010
ACM
We close affirmatively a question which has been open for long time: decidability of the HOM problem. The HOM problem consists in determining, given a tree homomorphism D and a re...