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...
Alexander Okhotin, Kai Salomaa, Michael Domaratzki
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...
CLaRK is an XML-based software system for corpora development. It incorporates several technologies: XML technology; Unicode; Regular Cascaded Grammars; Constraints over XML Docum...
Kiril Ivanov Simov, Alexander Simov, Milen Kouylek...
In formal language theory, James Rogers published a series of innovative papers generalising strings and trees to higher dimensions.Motivated by applications in linguistics, his go...
In this paper, we propose to extend XQuery - the XML query language - with a set of transformation operators which will produce a copy of an XML tree in which some subtrees will b...
Emmanuel Bruno, Jacques Le Maitre, Elisabeth Muris...