Improved descriptional complexity results on generalized forbidding grammars

DOI10.1007/978-3-030-11509-8_15OpenAlexW2910871810MaRDI QIDQ5919636

Rufus O. Oladele, Lakshmanan Kuppusamy, Indhumathi Raman, Henning Fernau

Publication date: 10 October 2019

Published in: Algorithms and Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-11509-8_15

zbMATH Keywords

computational completenesssemi-conditional grammarsgeneralized forbidding grammarsdescriptional complexity in formal languages

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (4)

Parsimonious computational completeness ⋮ Improved Descriptional Complexity Results for Simple Semi-Conditional Grammars ⋮ Improved descriptional complexity results on generalized forbidding grammars ⋮ Generalized forbidding matrix grammars and their membrane computing perspective

This page was built for publication: Improved descriptional complexity results on generalized forbidding grammars