http://iet.metastore.ingenta.com
1887

Relations and language models

Relations and language models

For access to this article, please select a purchase option:

Buy chapter PDF
$16.00
(plus tax if applicable)
Buy Knowledge Pack
10 chapters for $120.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
Handbook of Mathematical Models for Languages and Computation — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

We all use a variety of languages, ranging from high-level programming languages up to machine codes, to express our ideas representing procedures, which prescribe computers how to execute computational processes we have in mind. Just like finite sets, finite languages might be specified by listing all the strings. Apart from listing some trivial few -word languages, however, most specifications of this kind would be unbearably extensive and clumsy. More importantly, infinite languages, including almost all programing and natural languages, obviously cannot be specified by an exhaustive enumeration of their strings at all. Consequently, mathematical finite -size models for languages are central to this book as a whole. We base these models, customarily referred to as rewriting systems, upon relations (see Section 2.1). As a matter of fact, these systems underlie almost all language models covered in this book. The section defines rewriting systems in general, and concentrates its attention on using these systems as language -defining devices.

Chapter Contents:

  • 4.1 Rewriting systems
  • 4.2 Language-defining models

Inspec keywords: rewriting systems

Other keywords: mathematical finite-size models; language-defining devices; rewriting systems; language models

Subjects: Formal languages and computational linguistics

Preview this chapter:
Zoom in
Zoomout

Relations and language models, Page 1 of 2

| /docserver/preview/fulltext/books/pc/pbpc026e/PBPC026E_ch4-1.gif /docserver/preview/fulltext/books/pc/pbpc026e/PBPC026E_ch4-2.gif

Related content

content/books/10.1049/pbpc026e_ch4
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
This is a required field
Please enter a valid email address