@book{CTT100428074,
  author = {Masako HORAI},
  title = {Lambda-representable functions over free structures revisited},
  publisher = {Proc. of 3rd Int. Symp. on Functional and Logic Programming},
  year = 1998,
}

@book{CTT100428075,
  author = {Masako HORAI},
  title = {A primer on proofs and types},
  publisher = {Theories of Types and Proofs},
  year = 1998,
}

@book{CTT100428059,
  author = {寳来正子},
  title = {計算論--計算可能性とラムダ計算--},
  publisher = {近代科学社},
  year = 1991,
}

@book{CTT100428073,
  author = {Masako HORAI},
  title = {Theory of Automata},
  publisher = {共立出版},
  year = 1983,
}

@book{CTT100428069,
  author = {Masako HORAI},
  title = {Primitive transformations of regular sets and recognizable sets},
  publisher = {Automata,Languages,and Programming},
  year = 1973,
}

@book{CTT100428068,
  author = {Masako HORAI},
  title = {A tree generating system(共箸)},
  publisher = {Automation Languages,and Programming(Nivat ed,North-Holland)},
  year = 1973,
}

@article{CTT100428121,
  author = {Masako HORAI},
  title = {Lambda-definable functions over term algebras},
  journal = {International Journal of Foundations of Computer Science (to appear)},
  year = 1999,
}

@article{CTT100428065,
  author = {Masako HORAI},
  title = {Normal proofs and their grammar},
  journal = {Information and Computation},
  year = 1996,
}

@article{CTT100428064,
  author = {Masako HORAI},
  title = {Decidable properties of intersection type systems},
  journal = {Lecture Notes in Computer Science},
  year = 1995,
}

@article{CTT100428061,
  author = {Masako HORAI},
  title = {Parallel reductions in λ-calculus},
  journal = {Information and Computation},
  year = 1995,
}

@article{CTT100428062,
  author = {Masako HORAI},
  title = {A simple proof of the genericity lemma},
  journal = {Lecture Notes in Computer Science},
  year = 1994,
}

@article{CTT100428060,
  author = {Masako HORAI},
  title = {Lambda-calculi with conditional rules},
  journal = {Lecture Notes in Computer Science},
  year = 1993,
}

@article{CTT100428063,
  author = {Masako HORAI},
  title = {Normal proofs and their grammar(共箸)},
  journal = {Lecture Notes in Computer Science},
  year = 1991,
}

@article{CTT100428058,
  author = {Masako HORAI},
  title = {Parallel reduction in lambda-calculus},
  journal = {Journal of Symbolic Computation},
  year = 1989,
}

@article{CTT100428057,
  author = {Masako HORAI},
  title = {Brzozowski hierarchy of omega-languages},
  journal = {Theoretical Computer Science},
  year = 1987,
}

@article{CTT100428055,
  author = {Masako HORAI},
  title = {The greatest fixed-point and rational omega-tree languages},
  journal = {Theroretical Computer Science},
  year = 1986,
}

@article{CTT100428056,
  author = {Masako HORAI},
  title = {Characterization of omega-regular languages by monadic second-order formulas(共箸)},
  journal = {Theoretical Computer Science},
  year = 1986,
}

@article{CTT100428072,
  author = {Masako HORAI},
  title = {Logical formulas and four subclasses of w-regular languages(共箸)},
  journal = {Lecture Notes in Computer Science},
  year = 1985,
}

@article{CTT100428071,
  author = {Masako HORAI},
  title = {Charaterization of w-regular languages by first-order formulas(共箸)},
  journal = {Theoretical Computer Science},
  year = 1984,
}

@article{CTT100428054,
  author = {Masako HORAI},
  title = {Generalized parenthesis languages and minimalization of their parenthesis pairs(共箸)},
  journal = {Theoretical Computer Science},
  year = 1984,
}

@article{CTT100428053,
  author = {Masako HORAI},
  title = {A note on omega-regular languages(共箸)},
  journal = {Theoretical Computer Science},
  year = 1983,
}

@article{CTT100428052,
  author = {Masako HORAI},
  title = {Nest sets and relativized closure properties},
  journal = {Theoretical Computer Science},
  year = 1983,
}

@article{CTT100428070,
  author = {Masako HORAI},
  title = {Rational relations of binary trees},
  journal = {Lecture Notes in Computer Science},
  year = 1977,
}

@article{CTT100428050,
  author = {Masako HORAI},
  title = {Generalizations of regular sets and their application to a study of context-free languages},
  journal = {Information and Control},
  year = 1975,
}

@article{CTT100428051,
  author = {Masako HORAI},
  title = {Tree adjunct grammars(共箸)},
  journal = {Journal of Computer and System Sciences},
  year = 1975,
}

@article{CTT100428067,
  author = {Masako HORAI},
  title = {On improved proof for a theorem of N.chomsky},
  journal = {Proc. of Japan Academy},
  year = 1969,
}

@article{CTT100428066,
  author = {Masako HORAI},
  title = {On overrelaxztion factors of SOR methods},
  journal = {Science Reports of the Tokyo Kyoiku Daigaku},
  year = 1969,
}

@misc{CTT100595733,
  author = {Masako HORAI},
  title = {Regular sets of strings, trees, and W-structures},
  year = 1972,
}

@misc{CTT100594633,
  author = {Masako HORAI},
  title = {A characterization of the derivation trees of a context-free grammar
and an intercalation theorem},
  year = 1970,
}



@phdthesis{CTT100595733,
  author = {Masako HORAI},
  title = {Regular sets of strings, trees, and W-structures},
  school = {University of Pennsylvania},
  year = 1972,
}

@mastersthesis{CTT100594633,
  author = {Masako HORAI},
  title = {A characterization of the derivation trees of a context-free grammar
and an intercalation theorem},
  school = {University of Pennsylvania},
  year = 1970,
}