Warning:
JavaScript is turned OFF. None of the links on this page will work until it is reactivated.
If you need help turning JavaScript On, click here.
The Concept Map you are trying to access has information related to:
Rules are used in the derivation of Sentences, Abstract Machines are PDA, Abstract Machines are FSA, Abstract Machines are Turing Machines, Abstract Machines are LBA, Grammars are Unrestricted Grammars, Grammars are Context-Free Grammars, Grammars are Context-Sensitive Grammars, Grammars are Regular Grammars, LBA recognize Context-Sensitive Grammars, Grammatical Representations pertain to Languages, Grammatical Representations pertain to Grammars, FSA recognize Regular Grammars, Grammars classified according to the Chomsky Hierarchy, Semantic Representations include Operational Semantics, Semantic Representations include Denotational Semantics, Semantic Representations include Axiomatic Semantics, Semantic Representations include Attribute Grammars, Automata Theory considers Abstract Machines, Formal Language Theory addresses Automata Theory, Formal Language Theory addresses Semantic Representations, Formal Language Theory addresses Grammatical Representations, Rules may take the form of BNF/EBNF, Turing Machines recognize Unrestricted Grammars, Abstract Machines may be Deterministic or non-deterministic, Grammars describe legal Sentences, Grammars are represented with Rules, PDA recognize Context-Free Grammars