Ratings by cpressey of Formal Language works

Introduction to Formal Languages

• rating: 1

.

Natural Language Processing Techniques in Prolog

• rating: 1

.

Programs, Grammars, Arguments

• rating: TODO

.

The Hardest Context-Free Language

• rating: classic

.

Lecture 7: Definite Clause Grammars

• rating: 1

.

On the Structure of Context-Sensitive Grammars

• rating: 2

.

Functional Unification Grammar

• rating: 0

.

Definite Clause Grammars for Language Analysis

• rating: 1

.

Formal Languages and Infinite Groups

• rating: 1

.

Formal languages and groups as memory

• rating: 1

.

finite automata - Is there a reasonable and studied concept of reduction between regular languages? - Computer Science Stack Exchange

• rating: 1

.

parsers - Representing \"but not\" in formal grammar - Computer Science Stack Exchange

• rating: 1

.

formal languages - Proving that a word is *not* generated by a context-free grammar - Computer Science Stack Exchange

• rating: 1

.

closure properties - Does there exist an context free language L such that L∩L\^R is not context free? - Computer Science Stack Exchange

• rating: 1

.

computability - Context-free complete language - Computer Science Stack Exchange

• rating: 3

.

Natural examples of context-sensitive languages from practice - Theoretical Computer Science Stack Exchange

• rating: 1

.

idioms - Is \"regex\" in modern programming languages really \"context sensitive grammar\"? - Stack Overflow

• rating: 1

.