请输入您要查询的字词:

 

单词 ChomskySchutzenbergerTheorem
释义

Chomsky-Schützenberger theorem


An important characterization of context-free languages is captured in what is known as the Chomsky-Schützenberger theorem. It shows the intimate connection between context-free and parenthesis languages.

Theorem 1 (Chomsky-Schützenberger).

A langauge L over an alphabet Σ is context-free iff for some n0, there there is a homomorphismMathworldPlanetmathPlanetmathPlanetmathPlanetmathPlanetmathPlanetmathPlanetmathPlanetmath h:Σn*Σ* such that

L=h(𝐏𝐚𝐫𝐞𝐧𝒏R),

where Paren𝐧 is the parenthesis language over Σn, and R is a regular language (over Σn).

Note that the “if” part is the trivial consequence of the following facts: parenthesis languages are context-free; any homomorphic image of a context-free language is context-free; any intersectionMathworldPlanetmathPlanetmath of a context-free language with a regular language is context-free.

References

  • 1 N. Chomsky, M.P. Schützenberger, The Algebraic Theory of Context-Free Languages, Computer Programming and Formal Systems, North-Holland, Amsterdam (1963).
  • 2 D. C. Kozen, Automata and Computability, Springer, New York (1997).

随便看

 

数学辞典收录了18232条数学词条,基本涵盖了常用数学知识及数学英语单词词组的翻译及用法,是数学学习的有利工具。

 

Copyright © 2000-2023 Newdu.com.com All Rights Reserved
更新时间:2025/5/4 23:55:34