Patterns with Bounded Treewidth

DOI10.1007/978-3-642-28332-1_40zbMath1310.68137OpenAlexW191758795MaRDI QIDQ2890220

Daniel Reidenbach, Markus L. Schmid

Publication date: 8 June 2012

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://dspace.lboro.ac.uk/2134/9556

zbMATH Keywords

treewidthmembership problempattern languagesextended regular expressions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Related Items (3)

On the parameterised complexity of string morphism problems ⋮ A note on the complexity of matching patterns with variables ⋮ Patterns with bounded treewidth

This page was built for publication: Patterns with Bounded Treewidth