On the complexity of the string generation problem

DOI10.1515/156939203322694745MaRDI QIDQ4809650zbMATH OpenOpenAlexFDO

Authors Alexander Okhotin

Publication date 30 August 2004

Published in Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/156939203322694745

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Combinatorics in computer science (68R05)

Recommendations

• On the context-free production complexity of finite languages
• scientific article; zbMATH DE number 1688372
• Publication:4886090
• Compressed membership problems for regular expressions and hierarchical automata
• scientific article; zbMATH DE number 3917735

Cited in

(9)

• Hierarchical Lyapunov functions
• Nested \(\epsilon\)-decompositions and clustering of complex systems
• A scaling method for priorities in hierarchical structures
• Strategies for managing the structural and dynamic consequences of project complexity
• Best approximations of fitness functions of binary strings
• Decomposition of communication networks
• scientific article; zbMATH DE number 3883632 (Why is no real title available?)
• The State Complexity of Lexicographically Smallest Words and Computing Successors
• Recognizing Lexicographically Smallest Words and Computing Successors in Regular Languages

This page was built for publication: On the complexity of the string generation problem

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