(g//0,g//1,\dots ,g//k)-trees and unary OL systems
From MaRDI portal
Publication:1169816
DOI10.1016/0304-3975(83)90145-7zbMath0495.68056MaRDI QIDQ1169816
Publication date: 1983
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(83)90145-7
05C05: Trees
68R10: Graph theory (including graph drawing) in computer science
68Q42: Grammars and rewriting systems
Related Items
Using linear forms to determine the set of integers realizable by \((g_ 0,g_ 1,\dots ,g_ n)\)-trees, Defining families of trees with E0L grammars
Cites Work
- Unnamed Item
- Unnamed Item
- On random 2-3 trees
- On the correspondence between AVL trees and brother trees
- Characterization of unary developmental languages
- On the computational power of pushdown automata
- Ranking and Unranking of 2-3 Trees
- Description of developmental languages using recurrence systems
- Right brother trees