A note on context free languages, complexity classes, and diagonalization

DOI10.1007/BF01752398MaRDI QIDQ3928245zbMATH OpenOpenAlexFDO

Authors Forbes D. Lewis

Publication date 1981

Published in Mathematical Systems Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01752398

Mathematics Subject Classification ID

Applications of computability and recursion theory (03D80) Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Cites work

• Computational Complexity of One-Tape Turing Machine Computations
• Creative sets
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• scientific article; zbMATH DE number 3311755 (Why is no real title available?)
• scientific article; zbMATH DE number 3322505 (Why is no real title available?)
• Recursively enumerable sets of positive integers and their decision problems
• Space-bounded reducibility among combinatorial problems
• The complexity of theorem-proving procedures
• The Hardest Context-Free Language

This page was built for publication: A note on context free languages, complexity classes, and diagonalization

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