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

Regulated models

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

This chapter covers regulated language models, which are extended by additional mathematical mechanisms that prescribe the use of rules during the generation of their languages. An important advantage of these models lies in controlling their language-defining process and, therefore, operating in a more deterministic way than general models, which perform their derivations in a completely unregulated way. More significantly, the regulated versions of language models are stronger than their unregulated versions. The chapter covers grammars regulated by states, grammars regulated by control languages, matrix grammars, programmed grammars, and regulated automata.

Chapter Contents:

  • 12.1 Grammars regulated by states
  • 12.1.1 Definitions and examples
  • 12.1.2 Generative power
  • 12.2 Grammars regulated by control languages
  • 12.2.1 Definitions and examples
  • 12.2.2 Generative power
  • 12.3 Matrix grammars
  • 12.3.1 Definitions and examples
  • 12.3.2 Generative power
  • 12.3.3 Even matrix grammars
  • 12.3.3.1 Definitions and examples
  • 12.3.3.2 Generative power
  • 12.3.3.3 Summary
  • 12.4 Programmed grammars
  • 12.4.1 Definitions and examples
  • 12.4.2 Generative power
  • 12.5 Regulated automata and computation
  • 12.5.1 Self-regulating automata
  • 12.5.2 Self-regulating finite automata
  • 12.5.2.1 Definitions and examples
  • 12.5.2.2 Accepting power
  • 12.5.2.3 n-Turn first-move self-regulating finite automata
  • 12.5.2.4 Language families accepted by n-first-SFAs and n-all-SFAs
  • 12.5.3 Self-regulating pushdown automata
  • 12.5.3.1 Definitions
  • 12.5.3.2 Accepting power
  • 12.5.4 Open problems
  • 12.5.5 Regulated acceptance with control languages
  • 12.5.6 Finite automata regulated by control languages
  • 12.5.6.1 Definitions
  • 12.5.6.2 Conversions
  • 12.5.6.3 Regular-controlled finite automata
  • 12.5.6.4 Context-free-controlled finite automata
  • 12.5.6.5 Program-controlled finite automata
  • 12.5.7 Pushdown automata regulated by control languages
  • 12.5.7.1 Definitions
  • 12.5.7.2 Regular-controlled pushdown automata
  • 12.5.7.3 Linear-controlled pushdown automata
  • 12.5.7.4 One-turn linear-controlled pushdown automata
  • 12.5.8 Self-reproducing pushdown transducers
  • 12.5.9 Definitions
  • 12.5.10 Results

Inspec keywords: formal languages; automata theory; grammars

Other keywords: control language regulated grammars; mathematical mechanisms; language generation; state-regulated grammars; language-defining process; regulated language models; regulated automata; matrix grammars; programmed grammars

Subjects: Automata theory; Formal languages and computational linguistics

Preview this chapter:
Zoom in
Zoomout

Regulated models, Page 1 of 2

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

Related content

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