scientific article; zbMATH DE number 5201364

zbMath1258.68073MaRDI QIDQ5422229

Markus Holzer, Henning Bordihn

Publication date: 17 October 2007

Full work available at URL: http://www.jucs.org/jucs_8_2/on_the_computational_complexity

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

computational complexitydecision problemsformal languagessynchronized grammars

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items (3)

An infinite hierarchy induced by depth synchronization ⋮ The generative capacity of block-synchronized context-free grammars ⋮ On the synchronized derivation depth of context-free grammars

This page was built for publication: