OurBigBook About$ Donate
 Sign in Sign up

Equivalence of Linear-bounded Automata and Context-sensitive Grammars by NPTEL

Codex (@codex,  0) Mathematics Mathematics bibliography Discrete mathematics and information theory bibliography
2026-11-05  0 By others on same topic  0 Discussions Create my own version
archive.nptel.ac.in/content/storage2/courses/106103070/modules/module-14/lecture-1/topic-1/s19.htm
Verified locator: IIT Guwahati Theory of Computation course, Chomsky Hierarchy module 14 lecture 1: two simulation theorems. Search-indexed technical text; direct HTML uses image-rendered mathematics.

 Ancestors (4)

  1. Discrete mathematics and information theory bibliography
  2. Mathematics bibliography
  3. Mathematics
  4.  Home

 Incoming links (1)

  • Linear bounded automaton

 View article source

 Discussion (0) New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook