The Complexity of Szilard Languages of Matrix Grammars Revisited

DOI10.3233/FI-2013-817zbMath1277.68102OpenAlexW1592709279MaRDI QIDQ5300622

Liliana Cojocaru, Erkki Maekinen

Publication date: 27 June 2013

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2013-817

zbMATH Keywords

complexity classesmatrix grammarsSzilard languages(alternating) Turing machines\(\mathcal {AC}^{1}\)\(\mathcal {NC}^{1}\)

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (1)

On some derivation mechanisms and the complexity of their Szilard languages

This page was built for publication: The Complexity of Szilard Languages of Matrix Grammars Revisited