Results 11 to 20 of about 2,050,088 (230)

Tree algebra of sofic tree languages [PDF]

open access: yesRAIRO - Theoretical Informatics and Applications, 2014
We consider the languages of finite trees called tree-shift languages which are factorial extensible tree languages. These languages are sets of factors of sub-shifts of infinite trees. We give effective syntactic characterizations of two classes of regular tree-shift languages: the finite type tree languages and the tree languages which are almost of ...
Aubrun, Nathalie, Béal, Marie-Pierre
core   +13 more sources

Qualitative Tree Languages [PDF]

open access: yes2011 IEEE 26th Annual Symposium on Logic in Computer Science, 2011
We study finite automata running over infinite binary trees and we relax the notion of accepting run by allowing a negligible set (in the sense of measure theory) of non-accepting branches. In this qualitative setting, a tree is accepted by the automaton if there exists a run over this tree in which almost every branch is accepting. This leads to a new
Carayol, Arnaud   +2 more
openaire   +5 more sources

Weighted parsing of trees [PDF]

open access: yes, 2009
We show how parsing of trees can be formalized in terms of the intersection of two tree languages. The focus is on weighted regular tree grammars and weighted tree adjoining grammars.
Nederhof, Mark Jan   +2 more
core   +3 more sources

Language Trees and Zipping [PDF]

open access: yesPhysical Review Letters, 2002
In this letter we present a very general method to extract information from a generic string of characters, e.g. a text, a DNA sequence or a time series. Based on data-compression techniques, its key point is the computation of a suitable measure of the remoteness of two bodies of knowledge.
BENEDETTO, Dario   +2 more
openaire   +4 more sources

A Unified Framework to Compute over Tree Synchronized Grammars and Primal Grammars [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2002
Tree languages are powerful tools for the representation and schematization of infinite sets of terms for various purposes (unification theory, verification and specification ...).
Frédéric Saubion, Igor Stéphan
doaj   +3 more sources

Tree Languages Defined in First-Order Logic with One Quantifier Alternation [PDF]

open access: yesLogical Methods in Computer Science, 2010
We study tree languages that can be defined in \Delta_2 . These are tree languages definable by a first-order formula whose quantifier prefix is forall exists, and simultaneously by a first-order formula whose quantifier prefix is .
Mikolaj Bojanczyk, Luc Segoufin
doaj   +1 more source

Operational State Complexity of Deterministic Unranked Tree Automata [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2010
We consider the state complexity of basic operations on tree languages recognized by deterministic unranked tree automata. For the operations of union and intersection the upper and lower bounds of both weakly and strongly deterministic tree automata are
Xiaoxue Piao, Kai Salomaa
doaj   +1 more source

Query learning of derived $\omega$-tree languages in polynomial time [PDF]

open access: yesLogical Methods in Computer Science, 2019
We present the first polynomial time algorithm to learn nontrivial classes of languages of infinite trees. Specifically, our algorithm uses membership and equivalence queries to learn classes of $\omega$-tree languages derived from weak regular $\omega ...
Dana Angluin   +2 more
doaj   +1 more source

Weighted Regular Tree Grammars with Storage [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2018
We introduce weighted regular tree grammars with storage as combination of (a) regular tree grammars with storage and (b) weighted tree automata over multioperator monoids.
Zoltán Fülöp   +2 more
doaj   +1 more source

The Wadge Hierarchy of Deterministic Tree Languages [PDF]

open access: yesLogical Methods in Computer Science, 2008
We provide a complete description of the Wadge hierarchy for deterministically recognisable sets of infinite trees. In particular we give an elementary procedure to decide if one deterministic tree language is continuously reducible to another.
Filip Murlak
doaj   +1 more source

Home - About - Disclaimer - Privacy