Results 1  10
of
6,065
Tree Languages
"... •Tree language defn for TALs •Rid TAG of adj constraints! •Useful for ling? •Prob version is interesting 2 S ..."
Abstract
 Add to MetaCart
•Tree language defn for TALs •Rid TAG of adj constraints! •Useful for ling? •Prob version is interesting 2 S
Inference of reversible tree languages
 IEEE Transactions on Systems, Man, and Cybernetics, Part B
"... Abstract—In this paper, we study the notion ofreversibility andtestability when regular tree languages are involved. We present an inference algorithm for learning atestable tree language that runs in polynomial time with respect to the size of the sample used. We also study the tree language cla ..."
Abstract

Cited by 8 (3 self)
 Add to MetaCart
Abstract—In this paper, we study the notion ofreversibility andtestability when regular tree languages are involved. We present an inference algorithm for learning atestable tree language that runs in polynomial time with respect to the size of the sample used. We also study the tree language
Piecewise testable tree languages
"... This paper presents a decidable characterization of tree languages that can be defined by a boolean combination of Σ1 formulas. This is a tree extension of the Simon theorem, which says that a string language can be defined by a boolean combination of Σ1 formulas if and only if its syntactic monoid ..."
Abstract

Cited by 20 (8 self)
 Add to MetaCart
This paper presents a decidable characterization of tree languages that can be defined by a boolean combination of Σ1 formulas. This is a tree extension of the Simon theorem, which says that a string language can be defined by a boolean combination of Σ1 formulas if and only if its syntactic monoid
Varieties of Tree Languages
, 2005
"... Trees are among the most fundamental and ubiquitous structures in mathematics. Tree languages and automata on trees have been studied extensively since the 1960s from both a purely mathematical and application point of view. When trees are defined as terms, universal algebra becomes directly applica ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Trees are among the most fundamental and ubiquitous structures in mathematics. Tree languages and automata on trees have been studied extensively since the 1960s from both a purely mathematical and application point of view. When trees are defined as terms, universal algebra becomes directly
Decidable Properties of Tree Languages
, 2004
"... The first part of the thesis concerns problems related to the question: “when can a regular tree language be defined in firstorder logic? ” Characterizations in terms of automata of firstorder logic and the related chain logic are presented. A decidable property of tree automata called confusion i ..."
Abstract

Cited by 9 (6 self)
 Add to MetaCart
The first part of the thesis concerns problems related to the question: “when can a regular tree language be defined in firstorder logic? ” Characterizations in terms of automata of firstorder logic and the related chain logic are presented. A decidable property of tree automata called confusion
Semantics of ContextFree Languages
 In Mathematical Systems Theory
, 1968
"... "Meaning " may be assigned to a string in a contextfree language by defining "attributes " of the symbols in a derivation tree for that string. The attributes can be defined by functions associated with each production in the grammar. This paper examines the implications of th ..."
Abstract

Cited by 569 (0 self)
 Add to MetaCart
"Meaning " may be assigned to a string in a contextfree language by defining "attributes " of the symbols in a derivation tree for that string. The attributes can be defined by functions associated with each production in the grammar. This paper examines the implications
Qualitative Tree Languages
, 2011
"... Abstract—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 nonaccepting branches. In this qualitative setting, a tree is accepted by the automaton if there exists a run over this tree ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
this tree in which almost every branch is accepting. This leads to a new class of tree languages, called the qualitative tree languages that enjoys many properties. Then, we replace the existential quantification — a tree is accepted if there exists some accepting run over the input tree — by a
Tree Languager Arithmetic Compression
"... In this paper, we explore the applicability to compression tasks of the algorithms for regular language inference from stochastic samples. We compare two arithmetic encoders based upon two dierent kinds of formal languages: string languages and tree languages. The experiments show that treebased me ..."
Abstract
 Add to MetaCart
In this paper, we explore the applicability to compression tasks of the algorithms for regular language inference from stochastic samples. We compare two arithmetic encoders based upon two dierent kinds of formal languages: string languages and tree languages. The experiments show that tree
CIL: Intermediate language and tools for analysis and transformation of C programs
 In International Conference on Compiler Construction
, 2002
"... Abstract. This paper describes the CIntermediate Language: a highlevel representation along with a set of tools that permit easy analysis and sourcetosource transformation of C programs. Compared to C, CIL has fewer constructs. It breaks down certain complicated constructs of C into simpler ones, ..."
Abstract

Cited by 533 (11 self)
 Add to MetaCart
, and thus it works at a lower level than abstractsyntax trees. But CIL is also more highlevel than typical intermediate languages (e.g., threeaddress code) designed for compilation. As a result, what we have is a representation that makes it easy to analyze and manipulate C programs, and emit them in a
Minimalist tree languages are closed under intersection with recognizable tree languages
 In Logical Aspects of Computational Linguistics, LACL’11
"... Abstract. Minimalist grammars are a mildly contextsensitive grammar framework within which analyses in mainstream chomskyian syntax can be faithfully represented. Here it is shown that both the derivation tree languages and derived tree languages of minimalist grammars are closed under intersectio ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
Abstract. Minimalist grammars are a mildly contextsensitive grammar framework within which analyses in mainstream chomskyian syntax can be faithfully represented. Here it is shown that both the derivation tree languages and derived tree languages of minimalist grammars are closed under
Results 1  10
of
6,065