5Chomsky Hierarchy - Type 3 Grammar The strings generated...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Chomsky Hierarchy Turing Machine Type 0 Grammar Linear-Bounded Automaton Type 1 Grammar Pushdown Store Automaton Type 2 Grammar Finite State Automaton
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Type 3 Grammar The strings generated by each grammar on the right can be accepted by the automaton on the left....
View Full Document

This note was uploaded on 08/12/2008 for the course PSY 387R taught by Professor Diehl during the Spring '07 term at University of Texas at Austin.

Ask a homework question - tutors are online