Computing a context-free grammar-generating series
type: Item
instance of: scholarly article
title: Computing a context-free grammar-generating series
zbMATH Open document ID: 1007.68085
author: Bruce Litow
published in: Information and Computation
publication date: 2003-01-14T00:00:00Z
Mathematics Subject Classification ID: 68Q42
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68W10
zbMATH DE Number: 1853196
zbMATH Keywords: parallel complexity
zbMATH Keywords: computing context-free grammar-generating series
MaRDI profile type: Publication
full work available at URL: inco.2000.3023
OpenAlex ID: W2070190750
cites work: Optimization of LR(k) parsers
cites work: Log Depth Circuits for Division and Related Problems
cites work: Counting problems and algebraic formal power series in noncommuting variables
cites work: On Relating Time and Space to Size and Depth
cites work: Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
cites work: A taxonomy of problems with fast parallel algorithms
cites work: Q4023642
cites work: Q3994492
cites work: Analytic models and ambiguity of context-free languages
cites work: Algebraic functions over finite fields
cites work: Q3862379
cites work: Effective entropies and data compression
cites work: The complexity of ranking simple languages
cites work: Q4771385
cites work: Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial Factorization
cites work: Q3704880
cites work: On iterated integer product
cites work: The complexity of the word problems for commutative semigroups and polynomial ideals
cites work: Logarithmic Depth Circuits for Algebraic Functions
cites work: On uniform circuit complexity
cites work: Q5515507
cites work: Q3762226
cites work: Recognition and parsing of context-free languages in time n3
cites work: Bounded length UCFG equivalence
DOI: 10.1006/INCO.2000.3023
description: scientific article; zbMATH DE number 1853196