Pattern Matching in Trees and Nets

Published: 1983, Last Modified: 01 Jul 2024Acta Informatica 1983EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: Rational patterns are used to specify recognizable tree languages. It is shown that, given a rational patternp and a treet, one can decide inO(¦p¦·¦t¦) steps whether there is some match ofp int. Problems of this kind generalized to forests or nets are shown to be NP-complete.
Loading