Results 1  10
of
3,468
Distinguishability of locally finite trees
 Electron. J. Combin
"... The distinguishing number ∆(X) of a graph X is the least positive integer n for which there exists a function f: V (X) → {0, 1, 2, · · · , n−1} such that no nonidentity element of Aut(X) fixes (setwise) every inverse image f −1 (k), k ∈ {0, 1, 2, · · · , n − 1}. All infinite, locally finite t ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
trees without pendant vertices are shown to be 2distinguishable. A proof is indicated that extends 2distinguishability to locally countable trees without pendant vertices. It is shown that every infinite, locally finite tree T with finite distinguishing number contains a finite subtree J such that ∆(J
On the Bounded Theories of Finite Trees
 In Asian'96 Computing Science Conference
, 1996
"... . The theory of finite trees is the full firstorder theory of equality in the Herbrand universum (the set of ground terms) over a functional signature containing nonunary function symbols and constants. Albeit decidable, this theory turns out to be of the nonelementary complexity in the sense ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
. The theory of finite trees is the full firstorder theory of equality in the Herbrand universum (the set of ground terms) over a functional signature containing nonunary function symbols and constants. Albeit decidable, this theory turns out to be of the nonelementary complexity
Linguistics, logic and finite trees
 BULLETIN OF THE IGPL
, 1994
"... A modal logic is developed to deal with finite ordered binary trees as they are used in (computational) linguistics. A modal language is introduced with operators for the `mother of', `first daughter of' and `second daughter of' relations together with their transitive reflexive clos ..."
Abstract

Cited by 57 (4 self)
 Add to MetaCart
A modal logic is developed to deal with finite ordered binary trees as they are used in (computational) linguistics. A modal language is introduced with operators for the `mother of', `first daughter of' and `second daughter of' relations together with their transitive reflexive
Finite tree automata on infinite trees
 Bull. of Informatics and Cybernetics
, 1985
"... Finite tree automata on infinite trees which move from the root infinitely are investigated through six types of acceptance conditions. Each condition is an extension of the one used for finite automata on w words. We relate the six classes of infinite tree languages with the corresponding classes o ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Finite tree automata on infinite trees which move from the root infinitely are investigated through six types of acceptance conditions. Each condition is an extension of the one used for finite automata on w words. We relate the six classes of infinite tree languages with the corresponding classes
Residual Finite Tree Automata
 In Proceedings of the seventh int. conf. developments in Language Theory DLT’03, number 2710 in Lecture Notes in Computer Science
, 2003
"... Tree automata based algorithms are essential in many fields in computer science such as verification, specification, program analysis. They become also essential for databases with... ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
Tree automata based algorithms are essential in many fields in computer science such as verification, specification, program analysis. They become also essential for databases with...
Boolean functions for finitetree dependencies
 PROCEEDINGS OF THE 8TH INTERNATIONAL CONFERENCE ON LOGIC FOR PROGRAMMING, ARTIFICIAL INTELLIGENCE AND REASONING (LPAR 2001), R. NIEUWENHUIS AND A. VORONKOV, EDS. LECTURE NOTES IN ARTIFICIAL INTELLIGENCE
, 2001
"... Several logicbased languages, such as Prolog II and its successors, SICStus Prolog and Oz, offer a computation domain including rational trees that allow for increased expressivity and faster unification. Unfortunately, the use of infinite rational trees has problems. For instance, many of the buil ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
of the builtin and library predicates are illdefined for such trees and need to be supplemented by runtime checks whose cost may be significant. In a companion paper [3] we have proposed a dataflow analysis called finitetree analysis aimed at identifying those program variables (the finite variables
Linguistics, Logic and Finite Trees
"... A modal logic U developed to deal with finite ordered binary trees a * they are used in (computational) linguistics. A modal language is introduced with operators for the 'mother of, ' first daughter of and 'second daughter of relations together with their transitive reflexive closur ..."
Abstract
 Add to MetaCart
A modal logic U developed to deal with finite ordered binary trees a * they are used in (computational) linguistics. A modal language is introduced with operators for the 'mother of, ' first daughter of and 'second daughter of relations together with their transitive reflexive
Nondeterministic Finite Tree Automata
"... Abstract. We propose new antichainbased algorithms for checking universality and inclusion of nondeterministic tree automata (NTA). We have implemented these algorithms in a prototype tool and our experiments show that they provide a significant improvement over the traditional determinisationbase ..."
Abstract
 Add to MetaCart
Abstract. We propose new antichainbased algorithms for checking universality and inclusion of nondeterministic tree automata (NTA). We have implemented these algorithms in a prototype tool and our experiments show that they provide a significant improvement over the traditional determinisation
Special Finite Trees
"... of this thesis for form and content and recommend that it be accepted in ..."
A FirstOrder Axiomatization of the Theory of Finite Trees
, 1995
"... We provide firstorder axioms for the theories of finite trees with bounded branching and finite trees with arbitrary (finite) branching. The signature is chosen to express, in a natural way, those properties of trees most relevant to linguistic theories. These axioms provide a foundation for result ..."
Abstract

Cited by 53 (3 self)
 Add to MetaCart
We provide firstorder axioms for the theories of finite trees with bounded branching and finite trees with arbitrary (finite) branching. The signature is chosen to express, in a natural way, those properties of trees most relevant to linguistic theories. These axioms provide a foundation
Results 1  10
of
3,468