Generation of all the balanced parenthesis strings in lexicographical order

DOI10.1016/0020-0190(81)90098-3zbMath0476.68050OpenAlexW2015106305MaRDI QIDQ1159984

Ichiro Semba

Publication date: 1981

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(81)90098-3

zbMATH Keywords

algorithmlexicographical orderrunning timebalanced parenthesis strings

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Exact enumeration problems, generating functions (05A15) Discrete mathematics in relation to computer science (68R99)

Related Items (1)

On enumerating tree permutations in natural order

Cites Work

• Unnamed Item

This page was built for publication: Generation of all the balanced parenthesis strings in lexicographical order