/ Satoshi Okawa / Professor
/ Mohamed Hamada / Assistant Professor
The research and education activities in this laboratory focus on the theoretical and practical aspects related to language processing and language processing systems. In paticular, our work covers the following areas.
The research in this laboratory is devided into two parts:
The first part consists of the work that follows the research in the above areas. One of the most important goal of it is to provide the foundations for the education of language processing systems, programing languages, formal language theory.
The second part is the creative study in some specific areas ralated to language processing systems. The research activities of this part are based on the free work of each faculty member. Currently, we are working on
The recent parallel/distributed computation envirnment requires the development of a new language model and its processing model/system for such envirnment. Most programming languages and its processing systems for parallel/distributed systems have been developped based on the traditional computer systems. This development has some advantages and disadvantages. Therefore, the members of this laboratory consider that to design new languages and language processing system is the key work for the next development of the computer society and that it is one of the most important subjects for this laboratory tp study for establishing such models and implementing as real systems for evaluation.
The education on the subjects related tp languages and language processing systems is also the important mission of this laboratory. The courses given by the members of this laboratory include Discrete Systems, Automata and Languges, Language Processing Systems, Mathematical Logics, and SCCP, and Automata and Languages and Compilers, Adavanced Automata and Languages in the Graduate school.
Refereed Proceeding Papers
The notion of poly-slender languages is considered as an extention of one of slender languages and investivated extensively from not only the theoretical point of view but also the practical point of view. The homomorphic characterization of the class of poly-slender context-free languages are obtained with using the recent result that this class is coincides with the class of bounded context-free languages.
SFLP: a Solver for functional logic programs.