Lexicographical Generation of a Generalized Dyck Language

DOI10.1137/S0097539701394493MaRDI QIDQ4706237zbMATH OpenFDO

Authors Jens Liebehenschel

Publication date 19 June 2003

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/S0097539701394493

zbMATH Keywords

analysis of algorithmsDyck languagelexicographical generation

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Trees (05C05) Combinatorics in computer science (68R05) Combinatorics on words (68R15) Analysis of algorithms (68W40)

Recommendations

• scientific article; zbMATH DE number 572073
• On the enumeration and generation of generalized Dyck words
• Fast enumeration of words generated by Dyck grammars
• Dynamic algorithms for the Dyck languages
• scientific article; zbMATH DE number 5562328
• Generalized langford languages
• On complexity functions of infinite words associated with generalized Dyck languages
• On morphic generation of regular languages
• A note on multidimensional Dyck languages
• scientific article; zbMATH DE number 1261119

Cited in

(10)

• On the enumeration and generation of generalized Dyck words
• Ranking and unranking of a generalized Dyck language and the application to the generation of random trees
• Fast enumeration of words generated by Dyck grammars
• scientific article; zbMATH DE number 5562328 (Why is no real title available?)
• scientific article; zbMATH DE number 1195735 (Why is no real title available?)
• On the average complexity of the membership problem for a generalized Dyck language
• Dynamic algorithms for the Dyck languages
• A note on multidimensional Dyck languages
• Balanced-by-Construction Regular and ω-Regular Languages
• Balanced-by-construction regular and -regular languages

This page was built for publication: Lexicographical Generation of a Generalized Dyck Language

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