Results 21 to 30 of about 2,050,088 (230)

A decidable characterization of locally testable tree languages [PDF]

open access: yesLogical Methods in Computer Science, 2011
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

Regular Tree Algebras [PDF]

open access: yesLogical Methods in Computer Science, 2020
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]

open access: yes, 2012
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]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2018
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

ANALYSIS OF WORD SEARCH ALGORITHMS IN THE DICTIONARIES OF MACHINE TRANSLATION SYSTEMS FOR ARTIFICIAL LANGUAGES

open access: yesКомпютерні системи та інформаційні технології, 2023
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

open access: yesPLoS ONE, 2011
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]

open access: yesTheory of Computing Systems, 2013
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]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2012
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]

open access: yesTheory of Computing Systems, 2015
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

Tree Planar Languages [PDF]

open access: yesSeventh IEEE International Conference on Data Mining Workshops (ICDMW 2007), 2007
sponsorship ...
openaire   +3 more sources

Home - About - Disclaimer - Privacy