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

DOI10.1016/0304-3975(83)90145-7MaRDI QIDQ1169816zbMATH OpenOpenAlexFDO

Authors 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) Grammars and rewriting systems (68Q42) Graph theory (including graph drawing) in computer science (68R10)

Cites work

• Characterization of unary developmental languages
• Description of developmental languages using recurrence systems
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 3518272 (Why is no real title available?)
• On random 2-3 trees
• On the computational power of pushdown automata
• On the correspondence between AVL trees and brother trees
• Ranking and Unranking of 2-3 Trees
• Right brother trees

Cited in

(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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1169816)