|
寳来正子 研究業績一覧 (29件)
- 2024
- 2023
- 2022
- 2021
- 2020
![2023 2023](/r_arrow.gif)
![2019 2019](/rr_arrow.gif)
- 全件表示
論文
-
Masako HORAI.
Lambda-definable functions over term algebras,
International Journal of Foundations of Computer Science (to appear),
Vol. 00,
1999.
-
Masako HORAI.
Normal proofs and their grammar,
Information and Computation,
Vol. 125,
pp. 144-153,
1996.
-
Masako HORAI.
Decidable properties of intersection type systems,
Lecture Notes in Computer Science,
Vol. 902,
pp. 297-311,
1995.
-
Masako HORAI.
Parallel reductions in λ-calculus,
Information and Computation,
No. 118,
1995.
-
Masako HORAI.
A simple proof of the genericity lemma,
Lecture Notes in Computer Science,
Vol. 792,
pp. 117-118,
1994.
-
Masako HORAI.
Lambda-calculi with conditional rules,
Lecture Notes in Computer Science,
Vol. 644,
pp. 406-417,
1993.
-
Masako HORAI.
Normal proofs and their grammar(共箸),
Lecture Notes in Computer Science,
No. 789,
1991.
-
Masako HORAI.
Parallel reduction in lambda-calculus,
Journal of Symbolic Computation,
pp. 7,
1989.
-
Masako HORAI.
Brzozowski hierarchy of omega-languages,
Theoretical Computer Science,
pp. 49,
1987.
-
Masako HORAI.
The greatest fixed-point and rational omega-tree languages,
Theroretical Computer Science,
pp. 44,
1986.
-
Masako HORAI.
Characterization of omega-regular languages by monadic second-order formulas(共箸),
Theoretical Computer Science,
pp. 46,
1986.
-
Masako HORAI.
Logical formulas and four subclasses of w-regular languages(共箸),
Lecture Notes in Computer Science,
Vol. 192,
pp. 81-88,
1985.
-
Masako HORAI.
Charaterization of w-regular languages by first-order formulas(共箸),
Theoretical Computer Science,
Vol. 28,
pp. 315-327,
1984.
-
Masako HORAI.
Generalized parenthesis languages and minimalization of their parenthesis pairs(共箸),
Theoretical Computer Science,
pp. 31,
1984.
-
Masako HORAI.
A note on omega-regular languages(共箸),
Theoretical Computer Science,
pp. 23,
1983.
-
Masako HORAI.
Nest sets and relativized closure properties,
Theoretical Computer Science,
pp. 22,
1983.
-
Masako HORAI.
Rational relations of binary trees,
Lecture Notes in Computer Science,
Vol. 52,
pp. 524-538,
1977.
-
Masako HORAI.
Generalizations of regular sets and their application to a study of context-free languages,
Information and Control,
Vol. 27,
pp. 1,
1975.
-
Masako HORAI.
Tree adjunct grammars(共箸),
Journal of Computer and System Sciences,
Vol. 10,
pp. 2,
1975.
-
Masako HORAI.
On improved proof for a theorem of N.chomsky,
Proc. of Japan Academy,
Vol. 45,
No. 6,
pp. 441-442,
1969.
-
Masako HORAI.
On overrelaxztion factors of SOR methods,
Science Reports of the Tokyo Kyoiku Daigaku,
Vol. A10,
No. 232,
pp. 1-9,
1969.
著書
-
Masako HORAI.
Lambda-representable functions over free structures revisited,
Proc. of 3rd Int. Symp. on Functional and Logic Programming,
Proc. of 3rd Int. Symp. on Functional and Logic Programming,
pp. 1-19,
1998.
-
Masako HORAI.
A primer on proofs and types,
Theories of Types and Proofs,
Theories of Types and Proofs,
pp. 1-44,
1998.
-
寳来正子.
計算論--計算可能性とラムダ計算--,
近代科学社,
近代科学社,
1991.
-
Masako HORAI.
Theory of Automata,
共立出版,
共立出版,
1983.
-
Masako HORAI.
Primitive transformations of regular sets and recognizable sets,
Automata,Languages,and Programming,
Automata,Languages,and Programming,
pp. 475-480,
1973.
-
Masako HORAI.
A tree generating system(共箸),
Automation Languages,and Programming(Nivat ed,North-Holland),
Automation Languages,and Programming(Nivat ed,North-Holland),
pp. 453-465,
1973.
学位論文
-
Regular sets of strings, trees, and W-structures,
本文,
Doctor,
University of Pennsylvania,
1972/--/--,
-
A characterization of the derivation trees of a context-free grammar
and an intercalation theorem,
Master of Science,
University of Pennsylvania,
1970/--/--,
[ BibTeX 形式で保存 ]
[ 論文・著書をCSV形式で保存
]
[ 特許をCSV形式で保存
]
|