On the parallel recognition of unambiguous context-free languages
type: Item
instance of: scholarly article
title: On the parallel recognition of unambiguous context-free languages
zbMATH Open document ID: 0731.68063
DOI: 10.1016/0304-3975(91)90199-C
author: Michal Chytil
author: Maxime Crochemore
author: Wojciech Rytter
author: Burkhard Monien
published in: Theoretical Computer Science
publication date: 1991-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68N20
Mathematics Subject Classification ID: 68Q42
zbMATH DE Number: 4209612
zbMATH Keywords: parallel complexity
zbMATH Keywords: recognition of context-free languages
zbMATH Keywords: CREW PRAM
MaRDI profile type: Publication
cites work: Q3355240
cites work: Q3730022
cites work: Q3992991
cites work: Tree-size bounded alternation
cites work: Q3700838
cites work: Parallel time O(log n) recognition of unambiguous context-free languages
cites work: On efficient parallel computations of costs of paths on a grid graph
cites work: Time complexity of unambiguous path systems
full work available at URL: 0304-3975(91)90199-c
OpenAlex ID: W1975185331
description: scientific article; zbMATH DE number 4209612