Art
J-GLOBAL ID:200902002079777093   Reference number:89A0245451

A counterexample for “A simpler construction for showing the intrinsically exponential complexity of the circularity problem for attribute grammars”.

「属性文法に対する巡回性問題の本質的指数関数的複雑度を示すより簡単な説明」に対する反例
Author (1):
Material:
Volume: 36  Issue:Page: 92-96  Publication year: Jan. 1989 
JST Material Number: C0267A  ISSN: 0004-5411  CODEN: JACOA  Document type: Article
Article type: 原著論文  Country of issue: United States (USA)  Language: ENGLISH (EN)
Thesaurus term:
Thesaurus term/Semi thesaurus term
Keywords indexed to the article.
All keywords is available on JDreamIII(charged).
On J-GLOBAL, this item will be available after more than half a year after the record posted. In addtion, medical articles require to login to MyJ-GLOBAL.
,...
Semi thesaurus term:
Thesaurus term/Semi thesaurus term
Keywords indexed to the article.
All keywords is available on JDreamIII(charged).
On J-GLOBAL, this item will be available after more than half a year after the record posted. In addtion, medical articles require to login to MyJ-GLOBAL.

   To see more with JDream III (charged).   {{ this.onShowAbsJLink("http://jdream3.com/lp/jglobal/index.html?docNo=89A0245451&from=J-GLOBAL&jstjournalNo=C0267A") }}
JST classification (1):
JST classification
Category name(code) classified by JST.
Theory of computation 

Return to Previous Page