| 2002 | ||
|---|---|---|
| j14 | Mariangiola Dezani-Ciancaglini, Mitsuhiro Okada, Masako Takahashi: Theories of Types and Proofs 1997 - Preface. Theor. Comput. Sci. 272(1-2): 1-2 (2002) | |
| 2001 | ||
| j13 | Masako Takahashi: Lambda-Representable Functions Over Term Algebras. Int. J. Found. Comput. Sci. 12(1): 3-29 (2001) | |
| 2000 | ||
| c10 | ||
| 1998 | ||
| c9 | Masako Takahashi: Lambda-representable Functions over Free Structures Revisited. Fuji International Symposium on Functional and Logic Programming 1998: 1-19 | |
| 1996 | ||
| j12 | Masako Takahashi, Yohji Akama, Sachio Hirokawa: Normal Proofs and Their Grammar. Inf. Comput. 125(2): 144-153 (1996) | |
| 1995 | ||
| j11 | ||
| c8 | Toshihiko Kurata, Masako Takahashi: Decidable Properties of Intersection Type Systems. TLCA 1995: 297-311 | |
| 1994 | ||
| c7 | Masako Takahashi: A Simple Proof of the Genericity Lemma. Logic, Language and Computation 1994: 117-118 | |
| c6 | ||
| 1993 | ||
| c5 | ||
| 1989 | ||
| j10 | ||
| 1987 | ||
| j9 | ||
| 1986 | ||
| j8 | Masako Takahashi: The Greatest Fixed-Points and Rational Omega-Tree Languages. Theor. Comput. Sci. 44: 259-274 (1986) | |
| j7 | Hideki Yamasaki, Masako Takahashi, Kojiro Kobayashi: Characterization of omega-Regular Languages by Monadic Second-Order Formulas. Theor. Comput. Sci. 46(3): 91-99 (1986) | |
| 1984 | ||
| j6 | Kojiro Kobayashi, Masako Takahashi, Hideki Yamasaki: Characterization of omega-Regular Languages by First-Order Formulas. Theor. Comput. Sci. 28: 315-327 (1984) | |
| j5 | Hideki Yamasaki, Masako Takahashi: Generalized Parenthesis Languages and Minimization of their Parenthesis Parts. Theor. Comput. Sci. 31: 1-11 (1984) | |
| c4 | Kojiro Kobayashi, Masako Takahashi, Hideki Yamasaki: Logical formulas and four subclasses of omega-regular languages. Automata on Infinite Words 1984: 81-88 | |
| 1983 | ||
| j4 | Masako Takahashi: Nest Sets and Relativized Closure Properties. Theor. Comput. Sci. 22: 253-264 (1983) | |
| j3 | Masako Takahashi, Hideki Yamasaki: A Note on omega-Regular Languages. Theor. Comput. Sci. 23: 217-225 (1983) | |
| 1977 | ||
| c3 | ||
| 1975 | ||
| j2 | Masako Takahashi: Generalizations of Regular Sets and Their Applicatin to a Study of Context-Free Languages. Information and Control 27(1): 1-36 (1975) | |
| j1 | Aravind K. Joshi, Leon S. Levy, Masako Takahashi: Tree Adjunct Grammars. J. Comput. Syst. Sci. 10(1): 136-163 (1975) | |
| 1972 | ||
| c2 | ||
| c1 | Masako Takahashi: Primitive Tranformations of Regular Sets and Recognizable Sets. ICALP 1972: 475-480 | |
Colors in the list of coauthors
Last update Thu May 23 05:13:22 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page