| Presentation | 1994/1/26 The Universal Recognition Problems for Some Subclasses of Lexical-Functional Grammars Sachiko Ando, Ryuichi Nakanishi, Hiroyuki Seki, Tadao Kasami, |
|---|---|
| PDF Download Page | PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | The computational complexity of the universal recognition problems for dc-lfg′s and for rl-lfg′s are investigated.For a cla ss g of grammars,the universal recognition problem for g is the one to decide whether G can generate w for a given grammar G ∈ g a nd a string w.We show that the universal recognition problems for dc-lfg′s and for rl-lfg′s are EXP-POLY time-complete.It is also s hown that the problems for dc-lfg′s and rl-lfg′s with bounded dim ension are both NP-complete.Moreover,it is shown that the problems for dc-lfg′s and rl-lfg′s with bounded degree are both P-complete .The time complexity of the universal recognition problems for some subclasses of finite state translation systems are also investigated. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | lexical-functional grammars / parallel multiple context-free grammars / finite translation systems / universal recognition problem / computational complexity |
| Paper # | COMP93-67 |
| Date of Issue |
| Conference Information | |
| Committee | COMP |
|---|---|
| Conference Date | 1994/1/26(1days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Chair | |
| Vice Chair | |
| Secretary | |
| Assistant | |
| Paper Information | |
| Registration To | Theoretical Foundations of Computing (COMP) |
|---|---|
| Language | ENG |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | The Universal Recognition Problems for Some Subclasses of Lexical-Functional Grammars |
| Sub Title (in English) | |
| Keyword(1) | lexical-functional grammars |
| Keyword(2) | parallel multiple context-free grammars |
| Keyword(3) | finite translation systems |
| Keyword(4) | universal recognition problem |
| Keyword(5) | computational complexity |
| 1st Author's Name | Sachiko Ando |
| 1st Author's Affiliation | Department of Information and Computer Sciences,Faculty of Engineering Science,Osaka University() |
| 2nd Author's Name | Ryuichi Nakanishi |
| 2nd Author's Affiliation | Department of Information and Computer Sciences,Faculty of Engineering Science,Osaka University |
| 3rd Author's Name | Hiroyuki Seki |
| 3rd Author's Affiliation | Department of Information and Computer Sciences,Faculty of Engineering Science,Osaka University |
| 4th Author's Name | Tadao Kasami |
| 4th Author's Affiliation | Graduate School of Information Science,Nara Institute of Science and Technology |
| Date | 1994/1/26 |
| Paper # | COMP93-67 |
| Volume (vol) | vol.93 |
| Number (no) | 438 |
| Page | pp.pp.- |
| #Pages | 8 |
| Date of Issue | |