default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMasako Sato
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2006
[j6]Jin Uemura, Masako Sato:
Learning of erasing primitive formal systems from positive examples. Theor. Comput. Sci. 364(1): 98-114 (2006)- 2005
- [c14]Shinichi Hamano, Masako Sato:
Semantic Analysis of Association Rules via Item Response Theory. MLDM 2005: 641-650 - 2004
- [c13]Yasuhito Mukouchi, Masako Sato:
Learning Languages Generated by Elementary Formal Systems and Its Application to SH Languages. ALT 2004: 380-394 - [c12]Shinichi Hamano, Masako Sato:
Mining Indirect Association Rules. ICDM 2004: 106-116 - 2003
- [j5]Yasuhito Mukouchi, Masako Sato:
Refutable language learning with a neighbor system. Theor. Comput. Sci. 298(1): 89-110 (2003) - [c11]Jin Uemura, Masako Sato:
Learning of Erasing Primitive Formal Systems from Positive Examples. ALT 2003: 69-83 - 2002
- [c10]Jin Uemura, Masako Sato:
Compactness and Learning of Classes of Unions of Erasing Regular Pattern Languages. ALT 2002: 293-307 - [c9]Masako Sato, Yasuhito Mukouchi, Mikiharu Terada:
Refutable/Inductive Learning from Neighbor Examples and Its Application to Decision Trees over Patterns. Progress in Discovery Science 2002: 201-213 - 2001
- [c8]Yasuhito Mukouchi, Masako Sato:
Refutable Language Learning with a Neighbor System. ALT 2001: 267-282 - 2000
- [c7]Yasuhito Mukouchi, Masako Sato:
Language Learning with a Neighbor System. Discovery Science 2000: 183-196
1990 – 1999
- 1998
- [c6]Masako Sato, Yasuhito Mukouchi, Dao Zheng:
Characteristic Sets for Unions of Regular Pattern Languages and Compactness. ALT 1998: 220-233 - [c5]Yasuhito Mukouchi, Ikuyo Yamaue, Masako Sato:
Inferring a Rewriting System from Examples. Discovery Science 1998: 93-104 - [c4]Sadaaki Miyamoto, Masako Sato, Kazutaka Umayahara:
Generalization of discriminant analysis for possibility distributions. KES (3) 1998: 177-182 - 1995
- [j4]Takashi Moriyama, Masako Sato:
Properties of Language Classes with Finite Elasticity. IEICE Trans. Inf. Syst. 78-D(5): 532-538 (1995) - [c3]Setsuo Arikawa, Masako Sato, Ayumi Shinohara, Takeshi Shinohara:
Developments in Computational Learning and Discovery Theory within the Framework of Elementary Formal Systems. Machine Intelligence 15 1995: 227-247 - 1993
- [c2]Takashi Moriyama, Masako Sato:
Properties of Language Classes With Finite Elasticity. ALT 1993: 187-196 - 1991
- [c1]Masako Sato, Kazutaka Umayahara:
Inductive inferability for formal languages from positive data. ALT 1991: 84-92
1980 – 1989
- 1983
- [j3]Masako Sato, Thien Tran Cong:
The number of minimal lattice paths restricted by two parallel lines. Discret. Math. 43(2-3): 249-261 (1983) - [j2]Masako Sato:
Note on the number of minimal lattice paths restricted by two parallel lines. Discret. Math. 44(1): 117-121 (1983) - 1982
- [j1]Thien Tran Cong, Masako Sato:
One-dimensional random walk with unequal step lengths restricted by an absorbing barrier. Discret. Math. 40(2-3): 153-162 (1982)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:02 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
