On ``inherently context-sensitive languages -- an application of complexity cores

DOI10.1016/S0020-0190(05)80005-5zbMath0741.68064OpenAlexW1978988796MaRDI QIDQ1183427

Volker Diekert, Ronald V. Book

Publication date: 28 June 1992

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(05)80005-5

zbMATH Keywords

space complexitygeneralized complexity coreinherently context- sensitive language

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• The method of forced enumeration for nondeterministic automata
• The density and complexity of polynomial cores for intractable sets
• Nondeterministic Space is Closed under Complementation

This page was built for publication: On ``inherently context-sensitive languages -- an application of complexity cores