On the context-free production complexity of finite languages
type: Item
instance of: scholarly article
title: On the context-free production complexity of finite languages
zbMATH Open document ID: 0636.68098
DOI: 10.1016/S0166-218X(87)80004-5
published in: Discrete Applied Mathematics
publication date: 1987-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 4037251
zbMATH Keywords: finite language
zbMATH Keywords: context-free productions
author: Zsolt Tuza
MaRDI profile type: Publication
cites work: A lower-bound for the number of productions required for a certain class of languages
cites work: Context-free complexity of finite languages
cites work: Concise description of finite languages
cites work: Q5678435
cites work: Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices
Recommended article: Production Complexity of Some Operations on Context-Free Languages
Recommended article: Context-free complexity of finite languages
Recommended article: Kolmogorov Complexity and Deterministic Context-Free Languages
Recommended article: Q3505883
Recommended article: On the cover complexity of finite languages
Recommended article: On the complexity of realization of finite languages by formulas
Recommended article: On computational complexity of contextual languages
Recommended article: On regularity of context-free languages
Recommended article: Two complexity measures for context-free languages
Recommended article: ON THE DENSITY OF REGULAR AND CONTEXT-FREE LANGUAGES
description: scientific article; zbMATH DE number 4037251