Results 31 to 40 of about 19,622 (256)
Regular tree languages in low levels of the Wadge Hierarchy [PDF]
Logical Methods in Computer Science, 2019 In this article we provide effective characterisations of regular languages of infinite trees that belong to the low levels of the Wadge hierarchy. More precisely we prove decidability for each of the finite levels of the hierarchy; for the class of the ...
Mikołaj Bojańczyk +3 more
doaj +1 more source
Transformations Between Different Types of Unranked Bottom-Up Tree Automata [PDF]
Electronic Proceedings in Theoretical Computer Science, 2010 We consider the representational state complexity of unranked tree automata. The bottom-up computation of an unranked tree automaton may be either deterministic or nondeterministic, and further variants arise depending on whether the horizontal string ...
Xiaoxue Piao, Kai Salomaa
doaj +1 more source
Languages of Nested Trees [PDF]
, 2006 We study languages of nested trees—structures obtained by augmenting trees with sets of nested jump-edges. These graphs can naturally model branching behaviors of pushdown programs, so that the problem of branching-time software model checking may be phrased as a membership question for such languages.
Alur, Rajeev +2 more
openaire +2 more sources
Компютерні системи та інформаційні технології, 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
ANALYSIS OF TEXT AUGMENTATION ALGORITHMS IN ARTIFICIAL LANGUAGE MACHINE TRANSLATION SYSTEMS
Сучасні інформаційні системи, 2023 The work is devoted to the development of an organizational model of the machine translation system of artificial languages. The main goal is the analysis of text augmentation algorithms, which are significant elements of the developed machine ...
Anton Havrashenko , Olesia Barkovska
doaj +1 more source
Forests: the cross-linguistic perspective [PDF]
Geographica Helvetica, 2017 Do all humans perceive, think, and talk about tree cover (forests) in more or less the same way? International forestry programs frequently seem to operate on the assumption that they do.
N. Burenhult +10 more
doaj +1 more source
Syntactic Learning over Tree Tiers
LogicsThe class of tier-based strictly 2-local (TSL2) languages has been shown to be useful in modeling patterns across different linguistic domains. This paper discusses the learnability of the intersection closure of the TSL2 languages, multi-TSL2 (MTSL2). I
Logan Swanson
doaj +1 more source
Tree transducers and tree languages
Information and Control, 1978 Tree transducers (automata which read finite labeled trees and output finite labeled trees) are used to define a hierarchy of families of “tree languages” (sets of trees). In this hierarchy, families generated by “top-down” tree transducers (which read trees from the root toward the leaves) alternate with families generated by “bottom-up” tree ...
openaire +1 more source
Logical 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
IEEE Access, 2020 Tree comparison is an important method in various areas. In order to compare class hierarchy in object-oriented languages, there is a need to compare trees in the context of the hierarchy changes.
Danijel Mlinaric +2 more
doaj +1 more source