跳至内容
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
rdfs:seeAlso
schema:about
schema:about
schema:about
schema:about
schema:contributor
rdf:typeschema:Organization
schema:name"CARNEGIE INST OF TECH PITTSBURGH PA."
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)."
schema:exampleOfWork<http://worldcat.org/entity/work/id/47434171>
schema:inLanguage"en"
schema:name"New proofs of old theorems in logic and formal linguistics."
schema:numberOfPages"19"
schema:publisher
rdf:typeschema:Organization
schema:name"Defense Technical Information Center"

Content-negotiable representations

關閉視窗

請登入WorldCat 

没有帳號嗎?你可很容易的 建立免費的帳號.