(g//0,g//1,\dots ,g//k)-trees and unary OL systems
type: Item
instance of: scholarly article
title: (g//0,g//1,\dots ,g//k)-trees and unary OL systems
zbMATH Open document ID: 0495.68056
DOI: 10.1016/0304-3975(83)90145-7
author: S. Singh
published in: Theoretical Computer Science
publication date: 1983-01-01T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 68Q42
zbMATH DE Number: 3780576
MaRDI profile type: Publication
full work available at URL: 0304-3975(83)90145-7
OpenAlex ID: W1963917762
cites work: On the computational power of pushdown automata
cites work: Ranking and Unranking of 2-3 Trees
cites work: Characterization of unary developmental languages
cites work: Description of developmental languages using recurrence systems
cites work: Q4057549
cites work: Q4096430
cites work: Right brother trees
cites work: On the correspondence between AVL trees and brother trees
cites work: On random 2-3 trees
description: scientific article; zbMATH DE number 3780576