On the complexity of the string generation problem

DOI10.1515/156939203322694745zbMath1088.68611OpenAlexW2081341377MaRDI QIDQ4809650

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) Combinatorics in computer science (68R05) Formal languages and automata (68Q45)

Related Items (7)

Hierarchical Lyapunov functions ⋮ Nested \(\epsilon\)-decompositions and clustering of complex systems ⋮ The State Complexity of Lexicographically Smallest Words and Computing Successors ⋮ Strategies for managing the structural and dynamic consequences of project complexity ⋮ Recognizing Lexicographically Smallest Words and Computing Successors in Regular Languages ⋮ A scaling method for priorities in hierarchical structures ⋮ Decomposition of communication networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item

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