Some Problems in Formal Language Theory Known as Decidable are Proved EXPTIME Complete
スポンサーリンク
概要
著者
-
KASAI Takumi
Department of the Computer Science and Information Mathematics, University of Electro-Communications
-
Kasai Takumi
Department Of Computer Science University Of Electro-communications
-
Iwata Shigeki
Information Science Laboratory, Tokai University
-
Iwata Shigeki
Information Science Laboratory Tokai University
関連論文
- Multi-Phase Tree Transformations
- Some Problems in Formal Language Theory Known as Decidable are Proved EXPTIME Complete
- Some EXPTIME Complete Problems on Context-Free Languages