1 / 13

Linear Bounded Automata LBAs

Linear Bounded Automata LBAs. Linear Bounded Automata (LBAs) are the same as Turing Machines with one difference:. The input string tape space is the only tape space allowed to use. Linear Bounded Automaton (LBA). Input string. Working space in tape. Left-end marker. Right-end marker.

coby
Télécharger la présentation

Linear Bounded Automata LBAs

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Linear Bounded AutomataLBAs Costas Busch - RPI

  2. Linear Bounded Automata (LBAs) are the same as Turing Machines with one difference: The input string tape space is the only tape space allowed to use Costas Busch - RPI

  3. Linear Bounded Automaton (LBA) Input string Working space in tape Left-end marker Right-end marker All computation is done between end markers Costas Busch - RPI

  4. We define LBA’s as NonDeterministic Open Problem: NonDeterministic LBA’s have same power with Deterministic LBA’s ? Costas Busch - RPI

  5. Example languages accepted by LBAs: LBA’s have more power than NPDA’s LBA’s have also less power than Turing Machines Costas Busch - RPI

  6. The Chomsky Hierarchy Costas Busch - RPI

  7. Unrestricted Grammars: Productions String of variables and terminals String of variables and terminals Costas Busch - RPI

  8. Example unrestricted grammar: Costas Busch - RPI

  9. Theorem: A language is recursively enumerable if and only if is generated by an unrestricted grammar Costas Busch - RPI

  10. Context-Sensitive Grammars: Productions String of variables and terminals String of variables and terminals and: Costas Busch - RPI

  11. The language is context-sensitive: Costas Busch - RPI

  12. Theorem: A language is context sensistive if and only if is accepted by a Linear-Bounded automaton Observation: There is a language which is context-sensitive but not recursive Costas Busch - RPI

  13. The Chomsky Hierarchy Non-recursively enumerable Recursively-enumerable Recursive Context-sensitive Context-free Regular Costas Busch - RPI

More Related