Nonterminal complexity of programmed grammars.
From MaRDI portal
Publication:1401269
DOI10.1016/S0304-3975(02)00656-4zbMath1044.68076MaRDI QIDQ1401269
Publication date: 17 August 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
Descriptional complexity; Programmed grammars; Matrix grammars; Nonterminal complexity; Regulated rewriting
68Q42: Grammars and rewriting systems