scientific article

zbMath0421.68048MaRDI QIDQ3854627

Kurt Mehlhorn, Helmut Alt

Publication date: 1979

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

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

zbMATH Keywords

computational complexitylower boundslanguage of palindromesmultitape 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: