The complexity of linear and stratified context matching problems
From MaRDI portal
Publication:1764421
DOI10.1007/s00224-004-1151-9zbMath1061.68179MaRDI QIDQ1764421
Jürgen Stuber, Manfred Schmidt-Schauss
Publication date: 24 February 2005
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: http://publikationen.ub.uni-frankfurt.de/files/4587/lin_strat_cont_match.pdf
68W05: Nonnumerical algorithms
Related Items
Flat matching, Deterministic second-order patterns, On the relation between context and sequence unification, A Constraint Solver for Equations over Sequences and Contexts