The language intersection problem for non-recursive context-free grammars
type: Item
instance of: scholarly article
title: The language intersection problem for non-recursive context-free grammars
zbMATH Open document ID: 1069.68069
author: Mark-Jan Nederhof
author: Giorgio Satta
published in: Information and Computation
publication date: 2004-08-10T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q42
zbMATH DE Number: 2085626
zbMATH Keywords: Formal languages
zbMATH Keywords: Context-free grammars
zbMATH Keywords: Computational complexity
zbMATH Keywords: Parsing algorithms
MaRDI profile type: Publication
full work available at URL: j.ic.2004.03.004
OpenAlex ID: W2024730357
cites work: Optimization of LR(k) parsers
cites work: Q5541334
cites work: Q3992991
cites work: Q4198075
cites work: Q5583856
cites work: Q5592246
cites work: On the Decidability of Grammar Problems
cites work: Terminating Turing Machine Computations and the Complexity and/or decidability of Correspondence Problems, Grammars, and Program Schemes
cites work: On the equivalence, containment, and covering problems for the regular and context-free languages
cites work: Nondeterministic Space is Closed under Complementation
cites work: Q3915990
cites work: Q5180413
cites work: On the complexity analysis of static analyses
cites work: Q4040284
DOI: 10.1016/J.IC.2004.03.004
description: scientific article; zbMATH DE number 2085626