Tree-like parse and polynomial subclasses of search problems
type: Item
instance of: scholarly article
title: Tree-like parse and polynomial subclasses of search problems
zbMATH Open document ID: 0603.68085
DOI: 10.1016/0020-0190(86)90042-6
published in: Information Processing Letters
publication date: 1986-01-01T00:00:00Z
Mathematics Subject Classification ID: 68N20
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 3974334
zbMATH Keywords: context-free grammar
zbMATH Keywords: structured objected
zbMATH Keywords: tree-like parsing
zbMATH Keywords: graph grammar
author: V. Yu. Kryauchyukas
MaRDI profile type: Publication
full work available at URL: 0020-0190(86)90042-6
OpenAlex ID: W2065591743
cites work: Context-free grammars as a tool for describing polynomial-time subclasses of hard problems
cites work: Q4058132
cites work: Q4198056
description: scientific article; zbMATH DE number 3974334