Regular tree grammar

Known as: Regular tree, Regular tree language, RTG 
In theoretical computer science and formal language theory, a regular tree grammar (RTG) is a formal grammar that describes a set of directed trees… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Minimalist Grammars (MGs) (Stabler, 1997) are a formalisation of Chomsky’s minimalist program (Chomsky, 1995), which currently… (More)
  • figure 1
  • figure 4
  • figure 5
  • figure 3
  • table 2
Is this relevant?
2013
2013
An XML document is usually stored with its schema so that the structural consistency of the document is ensured. In general… (More)
  • figure 3
  • figure 1
  • figure 5
  • figure 6
  • table 1
Is this relevant?
2011
2011
  • C L A I R E G A R D E N T, B E N J A M I N G O T T E S M A N
  • 2011
Feature-based regular tree grammars (FRTG) can be used to ge nerate the derivation trees of a featurebased tree adjoining grammar… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2008
2008
We propose the use of regular tree grammars (RTGs) as a formalism for the underspecified processing of scope ambiguities. By… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2003
Highly Cited
2003
We propose regular expression pattern matching as a core feature of programming languages for manipulating XML. We extend… (More)
Is this relevant?
2001
2001
This paper describes the precise speci cation, design, analysis, implementation, and measurements of an e cient algorithm for… (More)
  • table 1
  • table 2
  • table 3
Is this relevant?
2000
2000
We address the problem of tight XML schemas and propose regular tree automata to model XML data. We show that the tree automata… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1992
Highly Cited
1992
This paper concerns a number of algorithmic problems on graphs and how they may be solved in a distributed fashion. The… (More)
Is this relevant?
Highly Cited
1991
Highly Cited
1991
Regular tree expressions are a natural formalism for describing the sets of tree-structured values that commonly arise in… (More)
Is this relevant?
Highly Cited
1976
Highly Cited
1976
The purpose of this paper is to demonstrate how a syntactic approach and, in particular, a tree system may be used to represent… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?