<link rel="stylesheet" href="styles.cf390c6bfbe7555f.css"> Skip to main content

IS CIRCULARITY PROBLEM FOR ATTRIBUTE GRAMMARS EXPONENTIAL-TIME COMPLETE

dc.citation.epage42en_US
dc.citation.issue7en_US
dc.citation.spage42en_US
dc.citation.volume29en_US
dc.citation.woscount0
dc.contributor.authorWU, PCen_US
dc.contributor.authorWANG, FJen_US
dc.contributor.department資訊科學與工程研究所zh_TW
dc.contributor.departmentInstitute of Computer Science and Engineeringen_US
dc.date.accessioned2014-12-08T15:03:55Z
dc.date.available2014-12-08T15:03:55Z
dc.date.issued1994-07-01en_US
dc.identifier.issn0362-1340en_US
dc.identifier.journalSIGPLAN NOTICESen_US
dc.identifier.urihttps://ir.lib.nycu.edu.tw/handle/11536/2443
dc.identifier.wosnumberWOS:A1994NU15200008
dc.language.isoen_USen_US
dc.subjectCOMPLEXITY STRUCTUREen_US
dc.subjectEXPONENTIAL-SPACE COMPLETEen_US
dc.subjectALTERNATING TURING MACHINESen_US
dc.titleIS CIRCULARITY PROBLEM FOR ATTRIBUTE GRAMMARS EXPONENTIAL-TIME COMPLETEen_US
dc.typeArticleen_US

Files

License bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed to upon submission
Description: