Results 1 to 10 of about 424 (110)
Piecewise testable tree languages [PDF]
This paper presents a decidable characterization of tree languages that can be defined by a boolean combination of Sigma_1 sentences. This is a tree extension of the Simon theorem, which says that a string language can be defined by a boolean combination
Mikołaj Bojańczyk +2 more
doaj +7 more sources
Tree Algebras and Varieties of Tree Languages
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Saeed Salehi
exaly +4 more sources
General Varieties of Tree Languages
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Magnus Steinby
exaly +2 more sources
State Complexity of Regular Tree Languages for Tree Matching [PDF]
We study the state complexity of regular tree languages for tree matching problem. Given a tree t and a set of pattern trees L, we can decide whether or not there exists a subtree occurrence of trees in L from the tree t by considering the new language L′ which accepts all trees containing trees in L as subtrees.
Sang-Ki Ko, Yo-Sub Han
exaly +3 more sources
Fuzzy Tree Language Recognizability
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Symeon Bozapalidis
exaly +4 more sources
Ambiguity Hierarchy of Regular Infinite Tree Languages [PDF]
An automaton is unambiguous if for every input it has at most one accepting computation. An automaton is k-ambiguous (for k > 0) if for every input it has at most k accepting computations. An automaton is boundedly ambiguous if it is k-ambiguous for some
Alexander Rabinovich, Doron Tiferet
doaj +1 more source
Aperiodicity, Star-freeness, and First-order Logic Definability of Operator Precedence Languages [PDF]
A classic result in formal language theory is the equivalence among non-counting, or aperiodic, regular languages, and languages defined through star-free regular expressions, or first-order logic.
Dino Mandrioli +2 more
doaj +1 more source
Phylogenetic trees: Grammar versus vocabulary
Traditionally, genealogical relationships between languages are established on the basis of phonetic and lexical data. The question whether genealogical relationships among languages can be defined based on grammatical data remains unanswered.
Vladimir N. Polyakov +2 more
doaj +1 more source
E-unification by means of tree tuple synchronized grammars [PDF]
The goal of this paper is both to give an E-unification procedure that always terminates, and to decide unifiability. For this, we assume that the equational theory is specified by a confluent and constructor-based rewrite system, and that four ...
Sébastien Limet, Pierre Réty
doaj +1 more source
Regular matching problems for infinite trees [PDF]
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

