77 search results - page 4 / 16 » Formal properties of XML grammars and languages |
PEPM
2007
ACM
14 years 1 months ago
2007
ACM
XML graphs have shown to be a simple and effective formalism for representing sets of XML documents in program analysis. It has evolved through a six year period with variants tai...
LACL
2005
Springer
14 years 27 days ago
2005
Springer
Abstract. Kanazawa has shown that k-valued classical categorial grammars have the property of finite elasticity [1], which is a sufficient condition for learnability. He has also ...
ACL
2001
13 years 8 months ago
2001
The theoretical study of the range concatenation grammar [RCG] formalism has revealed many attractive properties which may be used in NLP. In particular, range concatenation langu...
MFCS
2004
Springer
14 years 22 days 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...
GG
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. Triple Graph Grammars (TGGs) are a well-established concept for the specification of model transformations. In previous work we have formalized and analyzed already cruc...