Complexity of two-dimensional rank-reducing grammars

DOI10.1007/978-3-030-62536-8_13OpenAlexW3098700721MaRDI QIDQ2040419

Daniel Průša

Publication date: 14 July 2021

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

zbMATH Keywords

decidabilitypicture languagedescriptional complexityparsing complexityregular matrix grammartwo-dimensional context-free grammar

Mathematics Subject Classification ID

Theory of computing (68Qxx)

This page was built for publication: Complexity of two-dimensional rank-reducing grammars