<--- 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

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

Second-Order Abstract Categorial Grammars Makoto Kanazawa July 28,

Second-Order Abstract Categorial Grammars Makoto Kanazawa July 28,

DocID: 1qtVU - View Document

Program Specialization via Program Slicing Thomas Reps and Todd Turnidge University of Wisconsin Abstract This paper concerns the use of program slicing to perform a certain kind of program-specialization operation. The

Program Specialization via Program Slicing Thomas Reps and Todd Turnidge University of Wisconsin Abstract This paper concerns the use of program slicing to perform a certain kind of program-specialization operation. The

DocID: 1poTm - View Document

Foundations of XML Types: Tree Automata Pierre Genevès CNRS (slides mostly based on slides by W. Martens and T. Schwentick)  University of Grenoble Alpes, 2015–2016

Foundations of XML Types: Tree Automata Pierre Genevès CNRS (slides mostly based on slides by W. Martens and T. Schwentick) University of Grenoble Alpes, 2015–2016

DocID: 1oS7V - View Document

Automatic construction of parse trees for lexemes ∗ Danny Dub´e Anass Kadiri  Universit´e Laval

Automatic construction of parse trees for lexemes ∗ Danny Dub´e Anass Kadiri Universit´e Laval

DocID: 1g86D - View Document