Almost optimal sublinear time parallel recognition algorithms for three subclasses of context free languages
type: Item
instance of: scholarly article
title: Almost optimal sublinear time parallel recognition algorithms for three subclasses of context free languages
zbMATH Open document ID: 0902.68097
DOI: 10.1016/S0304-3975(97)00253-3
author: Lawrence L. Larmore
author: Wojciech Rytter
published in: Theoretical Computer Science
publication date: 1998-08-13T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q10
Mathematics Subject Classification ID: 68W15
zbMATH DE Number: 1189932
zbMATH Keywords: parallel computations
zbMATH Keywords: sublinear time
zbMATH Keywords: context-free languages
MaRDI profile type: Publication
cites work: Q4091421
cites work: Q4003168
cites work: On the parallel recognition of unambiguous context-free languages
cites work: Q3992991
cites work: Q4198075
cites work: Q3862379
cites work: An optimal sublinear time parallel algorithm for some dynamic programming problems
cites work: Fast recognition of deterministic cfl's with a smaller number of processors
cites work: On efficient parallel computations of costs of paths on a grid graph
description: scientific article; zbMATH DE number 1189932