Complexity Theory for Splicing Systems

DOI10.1007/978-3-540-73208-2_29zbMath1202.68196OpenAlexW1661416659MaRDI QIDQ5428241

Ogihara, Mitsunori, Remco Loos

Publication date: 28 November 2007

Published in: Developments in Language Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73208-2_29

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

This page was built for publication: Complexity Theory for Splicing Systems