Saved in:
| Main Author: | |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Tokyo, Japan
1989
|
| Series: | Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report
465 |
| Subjects: | |
| Abstract: | Abstract: "This paper is concerned with the problem of learning simple deterministic languages. The algorithm described in this paper is essentially based on the theory of model inference given by Shapiro. In our setting, however, nonterminal membership queries, for nonterminals except the start symbol, are not used. Instead of them, extended equivalence queries are used. Nonterminals that are necessary for a correct grammar and their meanings are introduced automatically. We show an algorithm that, for any simple deterministic language L, outputs a grammar G in 2-standard form, such that L= L(G), using membership and extended equivalence queries. |
| Physical Description: | 10 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010947376 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t| | ||
| 008 | 960912s1989 xx |||| 00||| engod | ||
| 035 | |a (OCoLC)23004618 | ||
| 035 | |a (DE-599)BVBBV010947376 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Ishizaka, Hiroki |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Learning simple deterministic languages |c H. Ishizaka |
| 264 | 1 | |a Tokyo, Japan |c 1989 | |
| 300 | |a 10 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report |v 465 | |
| 520 | 3 | |a Abstract: "This paper is concerned with the problem of learning simple deterministic languages. The algorithm described in this paper is essentially based on the theory of model inference given by Shapiro. In our setting, however, nonterminal membership queries, for nonterminals except the start symbol, are not used. Instead of them, extended equivalence queries are used. Nonterminals that are necessary for a correct grammar and their meanings are introduced automatically. We show an algorithm that, for any simple deterministic language L, outputs a grammar G in 2-standard form, such that L= L(G), using membership and extended equivalence queries. | |
| 650 | 4 | |a Inference | |
| 650 | 4 | |a Machine learning | |
| 830 | 0 | |a Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report |v 465 |w (DE-604)BV010923438 |9 465 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-007321578 | |
Record in the Search Index
| DE-BY-TUM_call_number | 0111 2001 B 6123-465 |
|---|---|
| DE-BY-TUM_katkey | 765109 |
| DE-BY-TUM_location | 01 |
| DE-BY-TUM_media_number | 040010278423 |
| _version_ | 1821931362853060608 |
| any_adam_object | |
| author | Ishizaka, Hiroki |
| author_facet | Ishizaka, Hiroki |
| author_role | aut |
| author_sort | Ishizaka, Hiroki |
| author_variant | h i hi |
| building | Verbundindex |
| bvnumber | BV010947376 |
| ctrlnum | (OCoLC)23004618 (DE-599)BVBBV010947376 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01588nam a2200301 cb4500</leader><controlfield tag="001">BV010947376</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">960912s1989 xx |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)23004618</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010947376</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="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Ishizaka, Hiroki</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Learning simple deterministic languages</subfield><subfield code="c">H. Ishizaka</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Tokyo, Japan</subfield><subfield code="c">1989</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">10 S.</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">Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report</subfield><subfield code="v">465</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "This paper is concerned with the problem of learning simple deterministic languages. The algorithm described in this paper is essentially based on the theory of model inference given by Shapiro. In our setting, however, nonterminal membership queries, for nonterminals except the start symbol, are not used. Instead of them, extended equivalence queries are used. Nonterminals that are necessary for a correct grammar and their meanings are introduced automatically. We show an algorithm that, for any simple deterministic language L, outputs a grammar G in 2-standard form, such that L= L(G), using membership and extended equivalence queries.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Inference</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Machine learning</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report</subfield><subfield code="v">465</subfield><subfield code="w">(DE-604)BV010923438</subfield><subfield code="9">465</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007321578</subfield></datafield></record></collection> |
| id | DE-604.BV010947376 |
| illustrated | Not Illustrated |
| indexdate | 2024-12-20T10:03:37Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007321578 |
| oclc_num | 23004618 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 10 S. |
| publishDate | 1989 |
| publishDateSearch | 1989 |
| publishDateSort | 1989 |
| record_format | marc |
| series | Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report |
| series2 | Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report |
| spellingShingle | Ishizaka, Hiroki Learning simple deterministic languages Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report Inference Machine learning |
| title | Learning simple deterministic languages |
| title_auth | Learning simple deterministic languages |
| title_exact_search | Learning simple deterministic languages |
| title_full | Learning simple deterministic languages H. Ishizaka |
| title_fullStr | Learning simple deterministic languages H. Ishizaka |
| title_full_unstemmed | Learning simple deterministic languages H. Ishizaka |
| title_short | Learning simple deterministic languages |
| title_sort | learning simple deterministic languages |
| topic | Inference Machine learning |
| topic_facet | Inference Machine learning |
| volume_link | (DE-604)BV010923438 |
| work_keys_str_mv | AT ishizakahiroki learningsimpledeterministiclanguages |
Branch Library Mathematics & Informatics, Reports
| Call Number: | 0111 2001 B 6123-465 |
|---|---|
| Copy 1 | Available for loan On Shelf |