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.
Regulated models, Page 1 of 2
< Previous page Next page > /docserver/preview/fulltext/books/pc/pbpc026e/PBPC026E_ch12-1.gif /docserver/preview/fulltext/books/pc/pbpc026e/PBPC026E_ch12-2.gif