Results 11 to 20 of about 19,622 (256)
Regular matching problems for infinite trees [PDF]
Logical Methods in Computer Science, 2022 We study the matching problem of regular tree languages, that is, "$\exists \sigma:\sigma(L)\subseteq R$?" where $L,R$ are regular tree languages over the union of finite ranked alphabets $\Sigma$ and $\mathcal{X}$ where $\mathcal{X}$ is an alphabet of ...
Carlos Camino +4 more
doaj +1 more source
Language Trees and Zipping [PDF]
Physical 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]
Discrete 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
Operational State Complexity of Deterministic Unranked Tree Automata [PDF]
Electronic 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
Tree Languages Defined in First-Order Logic with One Quantifier Alternation [PDF]
Logical 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
The Wadge Hierarchy of Deterministic Tree Languages [PDF]
Logical 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
Weighted Regular Tree Grammars with Storage [PDF]
Discrete 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
Query learning of derived $\omega$-tree languages in polynomial time [PDF]
Logical 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
Qualitative Tree Languages [PDF]
2011 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 +2 more sources
A decidable characterization of locally testable tree languages [PDF]
Logical 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