Nonterminal complexity of programmed grammars.
type: Item
instance of: scholarly article
title: Nonterminal complexity of programmed grammars.
zbMATH Open document ID: 1044.68076
DOI: 10.1016/S0304-3975(02)00656-4
author: Henning Fernau
published in: Theoretical Computer Science
publication date: 2003-08-17T00:00:00Z
Mathematics Subject Classification ID: 68Q42
zbMATH DE Number: 1965298
zbMATH Keywords: Regulated rewriting
zbMATH Keywords: Descriptional complexity
zbMATH Keywords: Programmed grammars
zbMATH Keywords: Matrix grammars
zbMATH Keywords: Nonterminal complexity
MaRDI profile type: Publication
cites work: Accepting grammars with regulation
cites work: Q4793127
cites work: ON THE LEFTMOST DERVIATION IN MATRIX GRAMMARS
cites work: Unconditional transfer in regulated rewriting
cites work: Regulated grammars under leftmost derivation
cites work: Q4530000
cites work: Q4939577
cites work: Q4530001
cites work: Remarks on blind and partially blind one-way multicounter machines
cites work: Petri net algorithms in the theory of matrix grammars
cites work: Q5592246
cites work: A hierarchy between context-free and context-sensitive languages
cites work: Machines, computations, and universality. 3rd international conference, MCU 2001, Chişinǎu, Moldova, May 23--27, 2001. Proceedings
cites work: Q4529992
cites work: Syntactic complexity of scattered context grammars
cites work: Four-nonterminal scattered context grammars characterize the family of recursively enumerable languages
cites work: Generative power of three-nonterminal scattered context grammars
cites work: Q3801102
cites work: Six nonterminals are enough for generating each r.e. language by a matrix grammar
cites work: Programmed Grammars and Classes of Formal Languages
description: scientific article; zbMATH DE number 1965298