| 2002 |
|---|
| 24 | EE | Mariangiola Dezani-Ciancaglini,
Mitsuhiro Okada,
Masako Takahashi:
Theories of Types and Proofs 1997 - Preface.
Theor. Comput. Sci. 272(1-2): 1-2 (2002) |
| 2001 |
|---|
| 23 | | Masako Takahashi:
Lambda-Representable Functions Over Term Algebras.
Int. J. Found. Comput. Sci. 12(1): 3-29 (2001) |
| 2000 |
|---|
| 22 | EE | Masahiro Kimoto,
Masako Takahashi:
On Computable Tree Functions.
ASIAN 2000: 273-289 |
| 1998 |
|---|
| 21 | | Masako Takahashi:
Lambda-representable Functions over Free Structures Revisited.
Fuji International Symposium on Functional and Logic Programming 1998: 1-19 |
| 1996 |
|---|
| 20 | | Masako Takahashi,
Yohji Akama,
Sachio Hirokawa:
Normal Proofs and Their Grammar.
Inf. Comput. 125(2): 144-153 (1996) |
| 1995 |
|---|
| 19 | | Toshihiko Kurata,
Masako Takahashi:
Decidable Properties of Intersection Type Systems.
TLCA 1995: 297-311 |
| 18 | | Masako Takahashi:
Parallel Reductions in lambda-Calculus
Inf. Comput. 118(1): 120-127 (1995) |
| 1994 |
|---|
| 17 | | Masako Takahashi:
A Simple Proof of the Genericity Lemma.
Logic, Language and Computation 1994: 117-118 |
| 16 | | Masako Takahashi,
Yohji Akama,
Sachio Hirokawa:
Normal Proofs and Their Grammar.
TACS 1994: 465-493 |
| 1993 |
|---|
| 15 | | Masako Takahashi:
Lambda-Calculi with Conditional Rules.
TLCA 1993: 406-417 |
| 1989 |
|---|
| 14 | | Masako Takahashi:
Parallel Reductions in lambda-Calculus.
J. Symb. Comput. 7(2): 113-123 (1989) |
| 1987 |
|---|
| 13 | | Masako Takahashi:
Brzozowski Hierarchy of omega-Languages.
Theor. Comput. Sci. 49: 1-12 (1987) |
| 1986 |
|---|
| 12 | | Masako Takahashi:
The Greatest Fixed-Points and Rational Omega-Tree Languages.
Theor. Comput. Sci. 44: 259-274 (1986) |
| 11 | | 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 |
|---|
| 10 | | Kojiro Kobayashi,
Masako Takahashi,
Hideki Yamasaki:
Logical formulas and four subclasses of omega-regular languages.
Automata on Infinite Words 1984: 81-88 |
| 9 | | Kojiro Kobayashi,
Masako Takahashi,
Hideki Yamasaki:
Characterization of omega-Regular Languages by First-Order Formulas.
Theor. Comput. Sci. 28: 315-327 (1984) |
| 8 | | Hideki Yamasaki,
Masako Takahashi:
Generalized Parenthesis Languages and Minimization of their Parenthesis Parts.
Theor. Comput. Sci. 31: 1-11 (1984) |
| 1983 |
|---|
| 7 | | Masako Takahashi:
Nest Sets and Relativized Closure Properties.
Theor. Comput. Sci. 22: 253-264 (1983) |
| 6 | | Masako Takahashi,
Hideki Yamasaki:
A Note on omega-Regular Languages.
Theor. Comput. Sci. 23: 217-225 (1983) |
| 1977 |
|---|
| 5 | | Masako Takahashi:
Rational relations of Binary Trees.
ICALP 1977: 524-538 |
| 1975 |
|---|
| 4 | | Masako Takahashi:
Generalizations of Regular Sets and Their Applicatin to a Study of Context-Free Languages
Information and Control 27(1): 1-36 (1975) |
| 3 | | Aravind K. Joshi,
Leon S. Levy,
Masako Takahashi:
Tree Adjunct Grammars.
J. Comput. Syst. Sci. 10(1): 136-163 (1975) |
| 1972 |
|---|
| 2 | | Aravind K. Joshi,
Leon S. Levy,
Masako Takahashi:
A Tree Generating System.
ICALP 1972: 453-465 |
| 1 | | Masako Takahashi:
Primitive Tranformations of Regular Sets and Recognizable Sets.
ICALP 1972: 475-480 |
