<--- Back to Details
First PageDocument Content
Mathematics / Chomsky hierarchy / Formal grammar / Regular language / Context-free grammar / Context-sensitive grammar / Automata theory / Deterministic finite automaton / Linear grammar / Formal languages / Theoretical computer science / Logic
Date: 2006-02-27 18:05:32
Mathematics
Chomsky hierarchy
Formal grammar
Regular language
Context-free grammar
Context-sensitive grammar
Automata theory
Deterministic finite automaton
Linear grammar
Formal languages
Theoretical computer science
Logic

Add to Reading List

Source URL: dingo.sbs.arizona.edu

Download Document from Source Website

File Size: 221,70 KB

Share Document on Facebook

Similar Documents

On the Visualization of Context-Free Grammar Ike Antkare International Institute of Technology United Slates of Earth

DocID: 1srZB - View Document

American Control Conference, JuneThe Motion Grammar Calculus for Context-Free Hybrid Systems Neil Dantam Mike Stilman

DocID: 1s0XJ - View Document

Synthesizing Context-Free Grammar Using Probabilistic Epistemologies Ike Antkare International Institute of Technology United Slates of Earth

DocID: 1s0Vh - View Document

Formal languages / Grammar / Language / Cognitive science / Formal grammar / Context-sensitive grammar / Tree-adjoining grammar / Context-free grammar / Regular tree grammar / Tree automaton / Regular language / Graph rewriting

24. Theorietag „Automaten und Formale Sprachen“ Caputh, 23. – 25. September 2014 Henning Bordihn, Bianca Truthe (Hrsg.)

DocID: 1rsDZ - View Document

Formal languages / Indexed grammar / Pumping lemma for context-free languages

m-multiple context-free grammars The Pumping Lemma for Well-Nested Multiple Context-Free Languages

DocID: 1rqE5 - View Document