String extension learning

String extension learning (2010)

by Jeffrey Heinz

Venue:

In Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics

Add To MetaCart

Results 1 - 1 of 1

• Σ = {C, V};

by J. Heinz, Finite Languages, S Cvcvcv

"... Finite languages are those recognized by rewrite grammars whose production rules are all of the form S → w where w belongs to Σ ∗. In other words, every rule rewrites the start symbol “S ” as a word (or sentence) in the language. ..."

Abstract - Add to MetaCart

Finite languages are those recognized by rewrite grammars whose production rules are all of the form S → w where w belongs to Σ ∗. In other words, every rule rewrites the start symbol “S ” as a word (or sentence) in the language.

String extension learning (2010)

Tools

• Σ = {C, V};