\(\varepsilon\)-productions in context-free grammars
type: Item
instance of: scholarly article
title: \(\varepsilon\)-productions in context-free grammars
zbMATH Open document ID: 0452.68082
DOI: 10.1007/BF00289308
author: Leslie M. Goldschlager
published in: Acta Informatica
publication date: 1981-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 3707802
zbMATH Keywords: space complexity
zbMATH Keywords: context-free language
zbMATH Keywords: membership problem
zbMATH Keywords: finiteness problems
zbMATH Keywords: epsilon-productions
zbMATH Keywords: emptiness problem
MaRDI profile type: Publication
cites work: An observation on time-storage trade off
cites work: Linear programming is log-space hard for P
cites work: A unified approach to models of synchronous parallel machines
cites work: A space efficient algorithm for the monotone planar circuit value problem
cites work: Q5592246
cites work: Complete problems for deterministic polynomial time
cites work: Q5180413
full work available at URL: https://doi.org/10.1007/bf00289308
OpenAlex ID: W2078130239
description: scientific article; zbMATH DE number 3707802