The complexity of linear and stratified context matching problems

DOI10.1007/S00224-004-1151-9zbMath1061.68179OpenAlexW1847375251MaRDI 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

zbMATH Keywords

stratified simultaneous monadic context matchingstratified simultaneous word matching

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Related Items (4)

A Constraint Solver for Equations over Sequences and Contexts ⋮ Flat matching ⋮ Deterministic second-order patterns ⋮ On the relation between context and sequence unification

This page was built for publication: The complexity of linear and stratified context matching problems