Generation of Well-Formed Parenthesis Strings in Constant Worst-Case Time

DOI10.1006/JAGM.1998.0960MaRDI QIDQ4217306zbMATH OpenOpenAlexFDO

Authors Timothy R. S. Walsh

Publication date 7 March 1999

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jagm.1998.0960

zbMATH Keywords

parenthesis strings

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Recommendations

• An Eades-McKay algorithm for well-formed parentheses strings
• Generalized parenthesis languages and minimization of their parenthesis parts
• Combinatorial Pattern Matching
• A simple optimal representation for balanced parentheses
• String-to-string interpretations with polynomial-size output
• Constant-memory iterative generation of special strings representing binary trees
• Enumeration and generation with a string automata representation
• scientific article; zbMATH DE number 4041305

Cited in

(7)

• Two shortest path metrics on well-formed parentheses strings
• Greedy Gray codes for Dyck words and ballot sequences
• A loop-free two-close Gray-code algorithm for listing k-ary Dyck words
• An Eades-McKay algorithm for well-formed parentheses strings
• A minimum-change version of the Chung-Feller theorem for Dyck paths
• A minimum-change version of the Chung-Feller theorem for Dyck paths
• Matchings In Three Catalan Lattices

This page was built for publication: Generation of Well-Formed Parenthesis Strings in Constant Worst-Case Time

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