Blocksequences of \(k\)-local words

DOI10.1007/978-3-030-67731-2_9zbMath1490.68173arXiv2008.03516OpenAlexW3128361210MaRDI QIDQ831795

Lukas Haschke, Florin Manea, Dirk Nowotka, Cedric Tsatia Tsida, Judith Wiedenbeck, Pamela Fleischmann

Publication date: 24 March 2022

Full work available at URL: https://arxiv.org/abs/2008.03516

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the parameterised complexity of string morphism problems
• Extended regular expressions: succinctness and decidability
• Patterns with bounded treewidth
• Algorithms for learning regular expressions from positive data
• Finding patterns common to a set of strings
• Pattern matching with variables: a multivariate complexity analysis
• Revisiting Shinohara's algorithm for computing descriptive patterns
• Linear work suffix array construction

This page was built for publication: Blocksequences of \(k\)-local words