Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,398,570 papers from all fields of science
Search
Sign In
Create Free Account
Regular tree grammar
Known as:
Regular tree
, Regular tree language
, RTG
Expand
In theoretical computer science and formal language theory, a regular tree grammar (RTG) is a formal grammar that describes a set of directed trees…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
19 relations
Code generation (compiler)
Constraint satisfaction problem
Dijkstra's algorithm
First-order logic
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Extracting differences between regular tree grammars
Kazumasa Horie
,
Nobutaka Suzuki
ACM Symposium on Applied Computing
2013
Corpus ID: 18108795
An XML document is usually stored with its schema so that the structural consistency of the document is ensured. In general…
Expand
2010
2010
Simplifying XML schema: single-type approximations of regular tree languages
W. Gelade
,
Tomasz Idziaszek
,
W. Martens
,
F. Neven
,
J. Paredaens
Journal of computer and system sciences (Print)
2010
Corpus ID: 9837225
XML Schema Definitions (XSDs) can be adequately abstracted by the single-type regular tree languages. It is well-known, that…
Expand
2008
2008
Tree Automata for Non-linear Arithmetic
N. Kobayashi
,
H. Ohsaki
International Conference on Rewriting Techniques…
2008
Corpus ID: 9982639
Tree automata modulo associativity and commutativity axioms, called AC tree automata, accept trees by iterating the transition…
Expand
2007
2007
Cooperative Strategies and Optimal Scheduling for Tree Networks
A. D. Baynast
,
Omer Gurewitz
,
E. Knightly
IEEE INFOCOM - 26th IEEE International…
2007
Corpus ID: 14247638
In this paper, we develop and analyze a low-complexity cooperative protocol that significantly increases the average throughput…
Expand
2003
2003
Logical definability and query languages over unranked trees
L. Libkin
,
F. Neven
18th Annual IEEE Symposium of Logic in Computer…
2003
Corpus ID: 13936512
Unranked trees, that is, trees with no restriction on the number of children of nodes, have recently attracted much attention…
Expand
2003
2003
An operational and denotational approach to non-context-freeness
H. Kolb
,
J. Michaelis
,
Uwe Mönnich
,
Frank Morawietz
Theoretical Computer Science
2003
Corpus ID: 8802393
2001
2001
Solving Regular Tree Grammar Based Constraints
Yanhong A. Liu
,
Ning Li
,
S. Stoller
Sensors Applications Symposium
2001
Corpus ID: 1265218
This paper describes the precise specification, design, analysis, implementation, and measurements of an efficient algorithm for…
Expand
2000
2000
Decidable first-order transition logics for PA-processes
D. Lugiez
,
P. Schnoebelen
Information and Computation
2000
Corpus ID: 2704443
Highly Cited
1993
Highly Cited
1993
Solving Systems of Set Constraints using Tree Automata
Rémi Gilleron
,
S. Tison
,
M. Tommasi
Symposium on Theoretical Aspects of Computer…
1993
Corpus ID: 12801290
A set constraint is of the form exp1\(\subseteq\)exp2 where exp1 and exp2 are set expressions constructed using variables…
Expand
1990
1990
Efficient Retargetable Code Generation Using Bottom-up Tree Pattern Matching
Arunachalam Balachandran
,
Dhananjay M. Dhamdhere
,
S. Biswas
Computer languages
1990
Corpus ID: 168747
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE