跳到内容
New proofs of old theorems in logic and formal linguistics. 预览资料
关闭预览资料
正在查...

New proofs of old theorems in logic and formal linguistics.

著者: Robert W Floyd; CARNEGIE INST OF TECH PITTSBURGH PA.
出版商: Ft. Belvoir Defense Technical Information Center NOV 1966.
版本/格式:   图书 : 英语
数据库:WorldCat
提要:
Theorem 1 constructs, from any word problem in a semi-Thue system, an equivalent Post correspondence problem, showing the undecidability of the general Post correspondence problem. Theorem 2 constructs, from any Post correspondence problem, a minimal linear grammar which is ambiguous exactly if the Post correspondence problem has a solution, showing the undecidability of the general ambiguity problem. (Other  再读一些...
评估:

(尚未评估) 0 附有评论 - 争取成为第一个。

主题
更多类似这样的

 

在图书馆查找

&AllPage.SpinnerRetrieving; 正在查找有这资料的图书馆...

详细书目

文件类型:
所有的著者/提供者: Robert W Floyd; CARNEGIE INST OF TECH PITTSBURGH PA.
OCLC号码: 227469361
注意: Prepared in cooperation with Computer Associates, Inc., Auburn, Mass., Contract AF 30(602)-3342.
描述: 19 p.

摘要:

Theorem 1 constructs, from any word problem in a semi-Thue system, an equivalent Post correspondence problem, showing the undecidability of the general Post correspondence problem. Theorem 2 constructs, from any Post correspondence problem, a minimal linear grammar which is ambiguous exactly if the Post correspondence problem has a solution, showing the undecidability of the general ambiguity problem. (Other standard undecidability results on phrase structure grammars are implied.) Theorem 3 constructs, from any word problem in a semi-Thue system, an ambiguity problem, combining the results of Theorem 1 and 2 by more direct means. No new results are presented, but standard proofs were shortened and constructions eliminated, combined, or simplified. (Author).

评论

用户提供的评论
正在获取GoodReads评论...
正在检索DOGObooks的评论

标签

争取是第一个!

相似资料

确认申请

你可能已经申请过这份资料。如果还是想申请,请选确认。

链接数据


<http://www.worldcat.org/oclc/227469361>
library:oclcnum"227469361"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/227469361>
rdf:typeschema:Book
schema:about
schema:about
schema:about
schema:contributor
schema:contributor
schema:datePublished"NOV 1966"
schema:datePublished"1966"
schema:description"Theorem 1 constructs, from any word problem in a semi-Thue system, an equivalent Post correspondence problem, showing the undecidability of the general Post correspondence problem. Theorem 2 constructs, from any Post correspondence problem, a minimal linear grammar which is ambiguous exactly if the Post correspondence problem has a solution, showing the undecidability of the general ambiguity problem. (Other standard undecidability results on phrase structure grammars are implied.) Theorem 3 constructs, from any word problem in a semi-Thue system, an ambiguity problem, combining the results of Theorem 1 and 2 by more direct means. No new results are presented, but standard proofs were shortened and constructions eliminated, combined, or simplified. (Author)."@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/1862883504>
schema:inLanguage"en"
schema:name"New proofs of old theorems in logic and formal linguistics."@en
schema:numberOfPages"19"
schema:publisher
schema:url

Content-negotiable representations

关闭窗口

请登入WorldCat 

没有张号吗?很容易就可以 建立免费的账号.