zbMath0421.68048MaRDI QIDQ3854627
Kurt Mehlhorn, Helmut Alt
Publication date: 1979
Full work available at URL: https://eudml.org/doc/92100
zbMATH Keywords
computational complexity; lower bounds; language of palindromes; multitape Turing machines; recognizing generators of the rational cone of context-free languages
Mathematics Subject Classification ID
68Q25: Analysis of algorithms and problem complexity
68Q45: Formal languages and automata
Cites Work