scientific article; zbMATH DE number 3655354

MaRDI QIDQ3854627zbMATH OpenFDO

Authors Helmut Alt, K. Mehlhorn

Publication date 1979

Full work available at URL https://eudml.org/doc/92100

zbMATH Keywords

computational complexitylanguage of palindromeslower boundsmultitape Turing machinesrecognizing generators of the rational cone of context-free languages

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Cites work

• Computational Complexity of One-Tape Turing Machine Computations
• scientific article; zbMATH DE number 3660806 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 3557269 (Why is no real title available?)
• scientific article; zbMATH DE number 3566211 (Why is no real title available?)
• scientific article; zbMATH DE number 3575000 (Why is no real title available?)
• scientific article; zbMATH DE number 3428547 (Why is no real title available?)
• scientific article; zbMATH DE number 3311755 (Why is no real title available?)

This page was built for publication:

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