A Note on Generating Well-formed Parenthesis Strings Lexicographically

DOI10.1093/comjnl/26.3.205zbMath0521.68082OpenAlexW2171997032MaRDI QIDQ3670599

M. C. Er

Publication date: 1983

Published in: The Computer Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/comjnl/26.3.205

zbMATH Keywords

binary treerecursive algorithmordered treesstack-sortable permutationswell-formed parenthesis strings

Mathematics Subject Classification ID

Trees (05C05) Discrete mathematics in relation to computer science (68R99)

Related Items (4)

Two shortest path metrics on well-formed parentheses strings ⋮ Ranking and Unranking of Non-regular Trees ⋮ A note on generating binary trees inA-order andB-order ⋮ On enumerating tree permutations in natural order

This page was built for publication: A Note on Generating Well-formed Parenthesis Strings Lexicographically