A heuristic derivation seeker for uniform prefix languages:
The paper describes the theoretical background and the realization of a program which tries to find the derivation of a prefix word ('the problem') for some classes of uniform prefix languages. The program can be applied to different language specifications which may contain a base alphabe...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Philadelphia, Pennsylvania
1965
|
| Schriftenreihe: | Moore School of Electrical Engineering <Philadelphia, Pa.>: Moore School report
1966,13 |
| Schlagworte: | |
| Zusammenfassung: | The paper describes the theoretical background and the realization of a program which tries to find the derivation of a prefix word ('the problem') for some classes of uniform prefix languages. The program can be applied to different language specifications which may contain a base alphabet, defined symbols, axioms, a substitution rule and transformation rules. The specification is similar to formalized logic, but is capable of expressing a much broader class of languages. The program reduces the problem to a Syntactic Normal Form and tries to find its derivation from the ad hoc productions of the language by using a heuristic goal-subgoal method (i.e., one which does not guarantee success, but usually results in better performance). The paper also contains a proof that it is sufficient to work with the Normal Form instead of the original problem. (Author). |
| Beschreibung: | Zugl.: Philadelphia, Pa., Univ. of Pennsylvania, Diss. |
| Beschreibung: | Getr. Zählung |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009919499 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 941125s1965 m||| 00||| engod | ||
| 035 | |a (OCoLC)227395109 | ||
| 035 | |a (DE-599)BVBBV009919499 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 100 | 1 | |a Chroust, Gerhard |d 1941- |e Verfasser |0 (DE-588)1012000389 |4 aut | |
| 245 | 1 | 0 | |a A heuristic derivation seeker for uniform prefix languages |
| 264 | 1 | |a Philadelphia, Pennsylvania |c 1965 | |
| 300 | |a Getr. Zählung | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Moore School of Electrical Engineering <Philadelphia, Pa.>: Moore School report |v 1966,13 | |
| 500 | |a Zugl.: Philadelphia, Pa., Univ. of Pennsylvania, Diss. | ||
| 520 | 3 | |a The paper describes the theoretical background and the realization of a program which tries to find the derivation of a prefix word ('the problem') for some classes of uniform prefix languages. The program can be applied to different language specifications which may contain a base alphabet, defined symbols, axioms, a substitution rule and transformation rules. The specification is similar to formalized logic, but is capable of expressing a much broader class of languages. The program reduces the problem to a Syntactic Normal Form and tries to find its derivation from the ad hoc productions of the language by using a heuristic goal-subgoal method (i.e., one which does not guarantee success, but usually results in better performance). The paper also contains a proof that it is sufficient to work with the Normal Form instead of the original problem. (Author). | |
| 650 | 4 | |a HEURISTIC METHODS | |
| 650 | 7 | |a Algorithms |2 dtict | |
| 650 | 7 | |a Classification |2 dtict | |
| 650 | 7 | |a Computer Hardware |2 scgdst | |
| 650 | 7 | |a Computer Programming and Software |2 scgdst | |
| 650 | 7 | |a Computer programming |2 dtict | |
| 650 | 7 | |a Digital computers |2 dtict | |
| 650 | 7 | |a Language |2 dtict | |
| 650 | 7 | |a Linguistics |2 dtict | |
| 650 | 7 | |a Linguistics |2 scgdst | |
| 650 | 7 | |a Specifications |2 dtict | |
| 650 | 7 | |a Syntax |2 dtict | |
| 650 | 7 | |a Theorems |2 dtict | |
| 650 | 7 | |a Transformational grammars |2 dtict | |
| 650 | 4 | |a Linguistik | |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 830 | 0 | |a Moore School of Electrical Engineering <Philadelphia, Pa.>: Moore School report |v 1966,13 |w (DE-604)BV009919041 |9 1966,13 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006570390 | ||
Datensatz im Suchindex
| _version_ | 1804124283447803904 |
|---|---|
| any_adam_object | |
| author | Chroust, Gerhard 1941- |
| author_GND | (DE-588)1012000389 |
| author_facet | Chroust, Gerhard 1941- |
| author_role | aut |
| author_sort | Chroust, Gerhard 1941- |
| author_variant | g c gc |
| building | Verbundindex |
| bvnumber | BV009919499 |
| ctrlnum | (OCoLC)227395109 (DE-599)BVBBV009919499 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02504nam a2200469 cb4500</leader><controlfield tag="001">BV009919499</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">941125s1965 m||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)227395109</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009919499</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Chroust, Gerhard</subfield><subfield code="d">1941-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1012000389</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A heuristic derivation seeker for uniform prefix languages</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Philadelphia, Pennsylvania</subfield><subfield code="c">1965</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">Getr. Zählung</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Moore School of Electrical Engineering <Philadelphia, Pa.>: Moore School report</subfield><subfield code="v">1966,13</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Zugl.: Philadelphia, Pa., Univ. of Pennsylvania, Diss.</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">The paper describes the theoretical background and the realization of a program which tries to find the derivation of a prefix word ('the problem') for some classes of uniform prefix languages. The program can be applied to different language specifications which may contain a base alphabet, defined symbols, axioms, a substitution rule and transformation rules. The specification is similar to formalized logic, but is capable of expressing a much broader class of languages. The program reduces the problem to a Syntactic Normal Form and tries to find its derivation from the ad hoc productions of the language by using a heuristic goal-subgoal method (i.e., one which does not guarantee success, but usually results in better performance). The paper also contains a proof that it is sufficient to work with the Normal Form instead of the original problem. (Author).</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">HEURISTIC METHODS</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Algorithms</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Classification</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer Hardware</subfield><subfield code="2">scgdst</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer Programming and Software</subfield><subfield code="2">scgdst</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer programming</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Digital computers</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Language</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Linguistics</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Linguistics</subfield><subfield code="2">scgdst</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Specifications</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Syntax</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Theorems</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Transformational grammars</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Linguistik</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4113937-9</subfield><subfield code="a">Hochschulschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Moore School of Electrical Engineering <Philadelphia, Pa.>: Moore School report</subfield><subfield code="v">1966,13</subfield><subfield code="w">(DE-604)BV009919041</subfield><subfield code="9">1966,13</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006570390</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV009919499 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:43:12Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006570390 |
| oclc_num | 227395109 |
| open_access_boolean | |
| physical | Getr. Zählung |
| publishDate | 1965 |
| publishDateSearch | 1965 |
| publishDateSort | 1965 |
| record_format | marc |
| series | Moore School of Electrical Engineering <Philadelphia, Pa.>: Moore School report |
| series2 | Moore School of Electrical Engineering <Philadelphia, Pa.>: Moore School report |
| spelling | Chroust, Gerhard 1941- Verfasser (DE-588)1012000389 aut A heuristic derivation seeker for uniform prefix languages Philadelphia, Pennsylvania 1965 Getr. Zählung txt rdacontent n rdamedia nc rdacarrier Moore School of Electrical Engineering <Philadelphia, Pa.>: Moore School report 1966,13 Zugl.: Philadelphia, Pa., Univ. of Pennsylvania, Diss. The paper describes the theoretical background and the realization of a program which tries to find the derivation of a prefix word ('the problem') for some classes of uniform prefix languages. The program can be applied to different language specifications which may contain a base alphabet, defined symbols, axioms, a substitution rule and transformation rules. The specification is similar to formalized logic, but is capable of expressing a much broader class of languages. The program reduces the problem to a Syntactic Normal Form and tries to find its derivation from the ad hoc productions of the language by using a heuristic goal-subgoal method (i.e., one which does not guarantee success, but usually results in better performance). The paper also contains a proof that it is sufficient to work with the Normal Form instead of the original problem. (Author). HEURISTIC METHODS Algorithms dtict Classification dtict Computer Hardware scgdst Computer Programming and Software scgdst Computer programming dtict Digital computers dtict Language dtict Linguistics dtict Linguistics scgdst Specifications dtict Syntax dtict Theorems dtict Transformational grammars dtict Linguistik (DE-588)4113937-9 Hochschulschrift gnd-content Moore School of Electrical Engineering <Philadelphia, Pa.>: Moore School report 1966,13 (DE-604)BV009919041 1966,13 |
| spellingShingle | Chroust, Gerhard 1941- A heuristic derivation seeker for uniform prefix languages Moore School of Electrical Engineering <Philadelphia, Pa.>: Moore School report HEURISTIC METHODS Algorithms dtict Classification dtict Computer Hardware scgdst Computer Programming and Software scgdst Computer programming dtict Digital computers dtict Language dtict Linguistics dtict Linguistics scgdst Specifications dtict Syntax dtict Theorems dtict Transformational grammars dtict Linguistik |
| subject_GND | (DE-588)4113937-9 |
| title | A heuristic derivation seeker for uniform prefix languages |
| title_auth | A heuristic derivation seeker for uniform prefix languages |
| title_exact_search | A heuristic derivation seeker for uniform prefix languages |
| title_full | A heuristic derivation seeker for uniform prefix languages |
| title_fullStr | A heuristic derivation seeker for uniform prefix languages |
| title_full_unstemmed | A heuristic derivation seeker for uniform prefix languages |
| title_short | A heuristic derivation seeker for uniform prefix languages |
| title_sort | a heuristic derivation seeker for uniform prefix languages |
| topic | HEURISTIC METHODS Algorithms dtict Classification dtict Computer Hardware scgdst Computer Programming and Software scgdst Computer programming dtict Digital computers dtict Language dtict Linguistics dtict Linguistics scgdst Specifications dtict Syntax dtict Theorems dtict Transformational grammars dtict Linguistik |
| topic_facet | HEURISTIC METHODS Algorithms Classification Computer Hardware Computer Programming and Software Computer programming Digital computers Language Linguistics Specifications Syntax Theorems Transformational grammars Linguistik Hochschulschrift |
| volume_link | (DE-604)BV009919041 |
| work_keys_str_mv | AT chroustgerhard aheuristicderivationseekerforuniformprefixlanguages |