Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 234,937,706 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.
2017
2017
Local behaviour of vacant set of random walk on large girth expander graphs
T. Hayder
2017
Corpus ID: 59443367
In dieser Arbeit koppeln wir den Pfad einer Irrfahrt auf einem Large Girth Expander Graph mit Random Interlacements auf dem…
Expand
2017
2017
An upper bound for the critical probability on the Cartesian product graph of a regular tree and a line
Kohei Yamamoto
2017
Corpus ID: 119321823
In Bernoulli bond percolation on the Cartesian product graph of a $d$-regular tree and a line, we give an upper bound for the…
Expand
2014
2014
Glauber Dynamics of colorings on trees
A. Sly
,
Yumeng Zhang
2014
Corpus ID: 117400013
The mixing time of the Glauber dynamics for spin systems on trees is closely related to reconstruction problem. Martinelli…
Expand
2011
2011
A randomised inference algorithm for regular tree languages
Johanna Björklund
Natural Language Engineering
2011
Corpus ID: 45219002
Abstract We present a randomised inference algorithm for regular tree languages. The algorithm takes as input two disjoint finite…
Expand
2011
2011
A Heuristic Algorithm for MPMGOOC
Wu You
,
Wu Xin
,
Jiang He
,
Min Fan
2011
Corpus ID: 64115646
Maximum Pattern Matching with Gaps and the One-Off Condition(MPMGOOC) is an interesting and challenging pattern matching problem…
Expand
2009
2009
Approximating Partition Functions of Two-State Spin Systems
Jinshan Zhang
,
Heng Liang
,
F. Bai
arXiv.org
2009
Corpus ID: 16788560
Two-state spin systems is a classical topic in statistical physics. We consider the problem of computing the partition function…
Expand
2000
2000
Caterpillars, context, tree automata and tree pattern matching
Anne Brüggemann-Klein
,
D. Wood
International Conference on Developments in…
2000
Corpus ID: 15579680
We present a novel, yet simple, technique for the speciication of context in struc-tured documents that we call caterpillar…
Expand
1999
1999
A Characterization of ETOL Tree Languages by Cooperating Regular Tree Grammars
Zoltán Fülöp
,
S. Maneth
Grammatical Models of Multi-Agent Systems
1999
Corpus ID: 14651589
In this paper we show that the class of tree languages generated by ETOL tree systems is equal to the class of tree languages…
Expand
1998
1998
An Algorithm for Comparing Deterministic Regular Tree Grammars
Byron L. Long
1998
Corpus ID: 1690207
An algorithm to decide inclusion for languages de ned by deterministic regular tree grammars is presented. The algorithm is shown…
Expand
1987
1987
Structural processing of waveforms as trees
S. Shaw
,
R. Figueiredo
ICASSP '87. IEEE International Conference on…
1987
Corpus ID: 5219724
Waveforms may be represented symbolically such that their underlying, global structural composition is emphasized. One such…
Expand