|
| This Article | ||
| | ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
| ASCII Text | x | ||
| S. Bergman, "R70-27 Tree Generating Regular Systems," IEEE Transactions on Computers, vol. 19, no. 8, pp. 764, August, 1970. | |||
| BibTex | x | ||
| @article{ 10.1109/T-C.1970.223032, author = {S. Bergman}, title = {R70-27 Tree Generating Regular Systems}, journal ={IEEE Transactions on Computers}, volume = {19}, number = {8}, issn = {0018-9340}, year = {1970}, pages = {764}, doi = {http://doi.ieeecomputersociety.org/10.1109/T-C.1970.223032}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - R70-27 Tree Generating Regular Systems IS - 8 SN - 0018-9340 SP EP EPD - 764 A1 - S. Bergman, PY - 1970 KW - null VL - 19 JA - IEEE Transactions on Computers ER - | |||
This paper concerns itself with rooted trees which have labeled nodes. The labels are taken from a stratified alphabet (each label is associated with a nonnegative number, the number of branches descending from it). The alphabet is divided into terminal and nonterminal labels. Tree generating grammars called regular systems are introduced. A set of trees serve as "axioms" and production rules of the form F??, where F and F are trees, allow successive replacement of subtrees F by ?. The "language" generated by such a system is the set of trees generable from the axioms containing terminal labels only. Such languages, when trees are written linearly (prefix or postfix form) are context free.
Citation:
S. Bergman, "R70-27 Tree Generating Regular Systems," IEEE Transactions on Computers, vol. 19, no. 8, pp. 764, Aug. 1970, doi:10.1109/T-C.1970.223032
Usage of this product signifies your acceptance of the Terms of Use.