Information and Systems-Theoretical Foundations of Computing(Date:1994/01/26)

Presentation
表紙

,  

[Date]1994/1/26
[Paper #]
目次

,  

[Date]1994/1/26
[Paper #]
The Universal Recognition Problems for Some Subclasses of Lexical-Functional Grammars

Sachiko Ando,  Ryuichi Nakanishi,  Hiroyuki Seki,  Tadao Kasami,  

[Date]1994/1/26
[Paper #]COMP93-67
On the generative capacity of VAR-CCG

Hiroyuki Ohnishi,  Ryuichi Nakanishi,  Hiroyuki Seki,  Tadao Kasami,  

[Date]1994/1/26
[Paper #]COMP93-68
Uniquely Parsable Grammars

Kenichi Morita,  Yasunori Yamamoto,  Noritaka Nishihara,  Zhiguo Zhang,  

[Date]1994/1/26
[Paper #]COMP93-69
Unification Problem for Term Rewriting Systems under Restricted Substitutions

Yuichi Kaji,  Toru Fujiwara,  Tadao Kasami,  

[Date]1994/1/26
[Paper #]COMP93-70
An OR-Compositional Semantics of Guarded Horn Clauses for Programs with Perpetual Processes

Toru Kato,  Masaki Murakami,  

[Date]1994/1/26
[Paper #]COMP93-71
Minimum Cost Graph Bisection Based on Subgraph Migration

Yoshiyasu Mimasa,  Kazunori Isomoto,  Shin'ichi Wakabayashi,  Tetsushi Koide,  norika Yosida,  

[Date]1994/1/26
[Paper #]COMP93-72
Simplicity-Preserving Augmentation of the Edge-Connectivity of a Graph

Satoshi Taoka,  Daisuke Takafuji,  Toshimasa Watanabe,  

[Date]1994/1/26
[Paper #]COMP93-73
Approximation Algorithms for the Minimum-Cost 3-Connectivity Augmentation Problem of Graphs

Hiroyuki Kawai,  Toshiya Mashima,  Satoshi Taoka,  Toshimasa Watanabe,  

[Date]1994/1/26
[Paper #]COMP93-74
Doubly Convex Grapls on Tree-ordered Sets and Bipartite Circle Graphs

Yasuchika Haruta,  Takashi Kizu,  Toshiro Araki,  Toshinobu Kashiwabara,  

[Date]1994/1/26
[Paper #]COMP93-75
An algorithm to decide concurrent firability for a marked qraph

Masaki Takahashi,  Toshiro Araki,  Toshinobu Kashiwabara,  

[Date]1994/1/26
[Paper #]COMP93-76
[OTHERS]

,  

[Date]1994/1/26
[Paper #]