Results 21 to 30 of about 2,050,088 (230)
A decidable characterization of locally testable tree languages [PDF]
A regular tree language L is locally testable if membership of a tree in L depends only on the presence or absence of some fix set of neighborhoods in the tree.
Thomas Place, Luc Segoufin
doaj +1 more source
We introduce a class of algebras that can be used as recognisers for regular tree languages. We show that it is the only such class that forms a pseudo-variety and we prove the existence of syntactic algebras.
Achim Blumensath
doaj +1 more source
Tree parsing with synchronous tree-adjoining grammars [PDF]
Restricting the input or the output of a grammar-induced translation to a given set of trees plays an important role in statistical machine translation. The problem for practical systems is to find a compact (and in particular, finite) representation of ...
Vogler, Heiko +2 more
core +2 more sources
Temporal Logic and Model Checking for Operator Precedence Languages [PDF]
In the last decades much research effort has been devoted to extending the success of model checking from the traditional field of finite state machines and various versions of temporal logics to suitable subclasses of context-free languages and ...
Michele Chiari +2 more
doaj +1 more source
The paper is devoted to the development of an organizational model of the machine translation system of artificial languages. The main goal is the analysis of word search algorithms in the dictionary, which are significant elements of the developed ...
Olesia Barkovska, Anton Havrashenko
doaj +1 more source
On the Accuracy of Language Trees
Historical linguistics aims at inferring the most likely language phylogenetic tree starting from information concerning the evolutionary relatedness of languages. The available information are typically lists of homologous (lexical, phonological, syntactic) features or characters for many different languages.
Simone Pompei +2 more
openaire +7 more sources
On the Separation Question for Tree Languages [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Arnold, André +2 more
openaire +6 more sources
Unambiguous Tree Languages Are Topologically Harder Than Deterministic Ones [PDF]
The paper gives an example of a tree language G that is recognised by an unambiguous parity automaton and is analytic-complete as a set in Cantor space.
Szczepan Hummel
doaj +1 more source
Regular Languages of Thin Trees [PDF]
For a fixed alphabet \(A\), a \textit{forest} is a ``mapping from its set of nodes \(\mathrm{dom}(t)\subset\omega^+\) into \(A\)''. It is additionally assumed that ``a forest is finitely branching: for every \(w\in\omega^\ast\) there are only finitely many nodes of the form \(wn\) for \(n\in {\mathbb N}\) in \(\mathrm{dom}(t)\)''; these nodes (of the ...
Bojanczyk, Mikolaj +2 more
openaire +5 more sources
sponsorship ...
openaire +3 more sources

