The complexity of Szilard languages of matrix grammars revisited

DOI10.3233/FI-2013-817MaRDI QIDQ5300622zbMATH OpenOpenAlexFDO

Authors Liliana Cojocaru, Erkki Mäkinen

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) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Grammars and rewriting systems (68Q42)

Recommendations

• On the complexity of Szilard languages of regulated grammars
• On some derivation mechanisms and the complexity of their Szilard languages
• Searching for traces of communication in szilard languages of parallel communicating grammar systems -- complexity views
• scientific article; zbMATH DE number 3974325
• Publication:4734777

Cited in

(4)

• On the complexity of Szilard languages of regulated grammars
• On some derivation mechanisms and the complexity of their Szilard languages
• A reformulation of matrix graph grammars with Boolean complexes
• Even linear simple matrix languages: formal language properties and grammatical inference.

This page was built for publication: The complexity of Szilard languages of matrix grammars revisited

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5300622)