IS CIRCULARITY PROBLEM FOR ATTRIBUTE GRAMMARS EXPONENTIAL-TIME COMPLETE

Full metadata record

DC Field	Value	Language
dc.contributor.author	WU, PC	en_US
dc.contributor.author	WANG, FJ	en_US
dc.date.accessioned	2014-12-08T15:03:55Z	-
dc.date.available	2014-12-08T15:03:55Z	-
dc.date.issued	1994-07-01	en_US
dc.identifier.issn	0362-1340	en_US
dc.identifier.uri	http://hdl.handle.net/11536/2443	-
dc.language.iso	en_US	en_US
dc.subject	COMPLEXITY STRUCTURE	en_US
dc.subject	EXPONENTIAL-SPACE COMPLETE	en_US
dc.subject	ALTERNATING TURING MACHINES	en_US
dc.title	IS CIRCULARITY PROBLEM FOR ATTRIBUTE GRAMMARS EXPONENTIAL-TIME COMPLETE	en_US
dc.type	Article	en_US
dc.identifier.journal	SIGPLAN NOTICES	en_US
dc.citation.volume	29	en_US
dc.citation.issue	7	en_US
dc.citation.spage	42	en_US
dc.citation.epage	42	en_US
dc.contributor.department	資訊科學與工程研究所	zh_TW
dc.contributor.department	Institute of Computer Science and Engineering	en_US
dc.identifier.wosnumber	WOS:A1994NU15200008	-
dc.citation.woscount	0	-
Appears in Collections:	Articles