A note on classes of complements and the LBA-problem

DOI10.1007/BF00289154zbMath0369.68041OpenAlexW2023160684MaRDI QIDQ1243140

Detlef Wotschke, Celia Wrathall

Publication date: 1978

Published in: Acta Informatica (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Comparing complexity classes
• A generator of context-sensitive languages
• Time- and tape-bounded Turing acceptors and AFLs
• Tape-bounded Turing acceptors and principal AFLs
• The Hardest Context-Free Language
• Studies in abstract families of languages

This page was built for publication: A note on classes of complements and the LBA-problem