Masako Takahashi

According to our database1, Masako Takahashi authored at least 22 papers between 1972 and 2002.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2002
Theories of Types and Proofs 1997 - Preface.
Theor. Comput. Sci., 2002

2001
Lambda-Representable Functions Over Term Algebras.
Int. J. Found. Comput. Sci., 2001

2000
On Computable Tree Functions.
Proceedings of the Advances in Computing Science, 2000

1998
Lambda-representable Functions over Free Structures Revisited.
Proceedings of the Third Fuji International Symposium on Functional and Logic Programming, 1998

1996
Normal Proofs and Their Grammar.
Inf. Comput., 1996

1995
Parallel Reductions in lambda-Calculus
Inf. Comput., April, 1995

Decidable Properties of Intersection Type Systems.
Proceedings of the Typed Lambda Calculi and Applications, 1995

1994
A Simple Proof of the Genericity Lemma.
Proceedings of the Logic, 1994

1993
Lambda-Calculi with Conditional Rules.
Proceedings of the Typed Lambda Calculi and Applications, 1993

1987
Brzozowski Hierarchy of omega-Languages.
Theor. Comput. Sci., 1987

1986
Characterization of omega-Regular Languages by Monadic Second-Order Formulas.
Theor. Comput. Sci., 1986

The Greatest Fixed-Points and Rational Omega-Tree Languages.
Theor. Comput. Sci., 1986

1984
Generalized Parenthesis Languages and Minimization of their Parenthesis Parts.
Theor. Comput. Sci., 1984

Characterization of omega-Regular Languages by First-Order Formulas.
Theor. Comput. Sci., 1984

Logical formulas and four subclasses of omega-regular languages.
Proceedings of the Automata on Infinite Words, 1984

1983
A Note on omega-Regular Languages.
Theor. Comput. Sci., 1983

Nest Sets and Relativized Closure Properties.
Theor. Comput. Sci., 1983

1977
Rational relations of Binary Trees.
Proceedings of the Automata, 1977

1975
Generalizations of Regular Sets and Their Applicatin to a Study of Context-Free Languages
Inf. Control., January, 1975

Tree Adjunct Grammars.
J. Comput. Syst. Sci., 1975

1972
Primitive Tranformations of Regular Sets and Recognizable Sets.
Proceedings of the Automata, 1972

A Tree Generating System.
Proceedings of the Automata, 1972


  Loading...