(g//0,g//1,\dots ,g//k)-trees and unary OL systems

DOI10.1016/0304-3975(83)90145-7zbMath0495.68056OpenAlexW1963917762MaRDI QIDQ1169816

S. Singh

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

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Grammars and rewriting systems (68Q42)

Related Items (2)

Defining families of trees with E0L grammars ⋮ Using linear forms to determine the set of integers realizable by \((g_ 0,g_ 1,\dots ,g_ n)\)-trees

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

This page was built for publication: (g//0,g//1,\dots ,g//k)-trees and unary OL systems