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

DOI10.1007/BF01752398zbMath0473.68038OpenAlexW1973470165MaRDI QIDQ3928245

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

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Space-bounded reducibility among combinatorial problems
• The Hardest Context-Free Language
• Computational Complexity of One-Tape Turing Machine Computations
• The complexity of theorem-proving procedures
• Recursively enumerable sets of positive integers and their decision problems
• Creative sets

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