Generation of all the balanced parenthesis strings in lexicographical order

DOI10.1016/0020-0190(81)90098-3zbMATH Open0476.68050OpenAlexW2015106305MaRDI QIDQ1159984FDOQ1159984

Authors: 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)

Cites Work

• Title not available (Why is that?)

Cited In (1)

• On enumerating tree permutations in natural order

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

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