| Title: | IS CIRCULARITY PROBLEM FOR ATTRIBUTE GRAMMARS EXPONENTIAL-TIME COMPLETE |
| Authors: | WU, PC WANG, FJ 資訊科學與工程研究所 Institute of Computer Science and Engineering |
| Keywords: | COMPLEXITY STRUCTURE;EXPONENTIAL-SPACE COMPLETE;ALTERNATING TURING MACHINES |
| Issue Date: | 1-Jul-1994 |
| URI: | http://hdl.handle.net/11536/2443 |
| ISSN: | 0362-1340 |
| Journal: | SIGPLAN NOTICES |
| Volume: | 29 |
| Issue: | 7 |
| Begin Page: | 42 |
| End Page: | 42 |
| Appears in Collections: | Articles |
- A WORST-CASE OF CIRCULARITY TEST ALGORITHMS FOR ATTRIBUTE GRAMMARS / WU, PC;WANG, FJ
- Multi-plan attribute grammars / Yang, W
- A finest partitioning algorithm for attribute grammars / Yang, W
- Analysis on machined feature recognition techniques based on B-rep / Wu, MC;Liu, CR
- A lattice framework for analyzing context-free languages with applications in parser simplification and data-flow analysis / Yang, W
- Optimization of TQFP molding process using neuro-fuzzy-GA approach / Chiang, TL;Su, CT
- Two-machine flow shop scheduling of polyurethane foam production / Lin, Bertrand M. T.;Lin, Y-Y;Fang, K-T
Loading...