zum Inhalt wechseln
New proofs of old theorems in logic and formal linguistics. Titelvorschau
SchließenTitelvorschau
Prüfung…

New proofs of old theorems in logic and formal linguistics.

Verfasser/in: Robert W Floyd; CARNEGIE INST OF TECH PITTSBURGH PA.
Verlag: Ft. Belvoir Defense Technical Information Center NOV 1966.
Ausgabe/Format   Buch : Englisch
Datenbank:WorldCat
Zusammenfassung:
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  Weiterlesen…
Bewertung:

(noch nicht bewertet) 0 mit Rezensionen - Verfassen Sie als Erste eine Rezension.

Themen
Ähnliche Titel

 

Exemplar ausleihen

&AllPage.SpinnerRetrieving; Suche nach Bibliotheken, die diesen Titel besitzen ...

Details

Dokumenttyp: Buch
Alle Autoren: Robert W Floyd; CARNEGIE INST OF TECH PITTSBURGH PA.
OCLC-Nummer: 227469361
Anmerkungen: Prepared in cooperation with Computer Associates, Inc., Auburn, Mass., Contract AF 30(602)-3342.
Beschreibung: 19 p.

Abstract:

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

Rezensionen

Nutzer-Rezensionen
Suche nach GoodReads-Rezensionen
Suche nach DOGObooks-Rezensionen…

Tags

Tragen Sie als Erste Tags ein.

Ähnliche Titel

Anfrage bestätigen

Sie haben diesen Titel bereits angefordert. Wenn Sie trotzdem fortfahren möchten, klicken Sie auf OK.

Verlinkung


<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

Fenster schließen

Bitte in WorldCat einloggen 

Sie haben kein Konto? Sie können sehr einfach ein kostenloses Konto anlegen,.