<--- Back to Details
First PageDocument Content
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
Date: 2015-10-19 16:22:16
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.)

Add to Reading List

Source URL: fg-afs.gi.de

Download Document from Source Website

File Size: 2,11 MB

Share Document on Facebook

Similar Documents

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

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

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

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

DocID: 1s0Vh - View Document

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

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

DocID: 1rsDZ - View Document

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

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

DocID: 1rqE5 - View Document